Transmitting apparatus, transmitting method, source packet generating apparatus, source packet generating method, packet mode determining method, medium and program

ABSTRACT

A transmitting apparatus for transmitting a source packet constructed of a pair of data of a source packet data and a source packet header including a time stamp, has transmission packet generating means of investigating values of a predetermined portion of the time stamp included in the source packet when the source packet is inputted, unifying the source packets that have a same value for the predetermined portion and are inputted in series to output as one unit of transmission packet data; and  
     data outputting means of producing a transmission packet by adding predetermined additional information to the outputted transmission packet data and outputting the produced transmission packet outward.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to a transmitting apparatus thatexecutes transmission processing by constructing transmission packetfrom a source packet including a source packet header, a packet modedetermining method, a source packet generating apparatus for generatinga source packet, a medium and a program.

[0003] 2. Related Art of the Invention

[0004] Accompanied by progress of the LSI technology, a network todigitalize image information and sound information and transmit is beingdeveloped. Since the image signals and sound signals need to bereproduced in real time, a network that can execute real timetransmission will become necessary.

[0005] As a network that is suitable for such real time transmission,there is a network called IEEE1394. The IEEE1394 can send data bysynchronous transmission with a serial rapid bus system, and thereforereal time transmission is possible.

[0006] The IEEE1394 can be mounted on a lot of digital image soundequipment including a Set Top Box (to be described as “STB” as follows)to receive MPEG2 data from satellite broadcasting etc. as an interfaceto be installed outside. For example, in an STB, the IEEE1394 is used sothat data transmission between other AV equipment and the STB can beexecuted. IEC61883 has been established as standards for transmitting AVdata such as MPEG2 with the IEEE1394.

[0007] On the other hand, also as for a personal computer (to bedescribed as “PC” as follows), Windows 98 of Microsoft Corporation beinga standard OS has got used to support the IEEE1394 officially andconsequently the IEEE1394 is rapidly proliferating in the PC industry aswell.

[0008] Now, a method to transmit on the IEEE1394 a transport streampacket (to be described as “TS packet” as follows) of the MPEG2 in theIEC61883 will be described with reference to FIGS. 1 to 6.

[0009]FIG. 1 is a construction of a source packet. In FIG. 1, referencenumeral 101 denotes a TS packet, reference numeral 102 does a sourcepacket header, and reference numeral 103 does a source packet.

[0010]FIG. 2 is a construction of a source packet header 102. In FIG. 2,reference numeral 201 denotes a time stamp and reference numeral 202does spare information.

[0011]FIG. 3 denotes a construction example of CIP data. In FIG. 3,reference numeral 301 denotes a CIP header and reference numeral 302does CIP data.

[0012]FIG. 4 is a construction of an isochronous packet. In FIG. 4,reference numeral 401 denotes the isochronous packet, reference numeral402 does an isochronous header, reference numeral 403 does a header CRCand reference numeral 404 does data CRC.

[0013]FIG. 5 is a conceptional view at the time of transmission of TSpackets 101.

[0014]FIG. 6 is a construction of Cycle Time Register (to be describedas “CTR” as follows) in the IEEE1394. In FIG. 6, reference numeral 601denotes a CTR.

[0015] Firstly, as shown in FIG. 1, the source packet header 102 isadded to the TS packet 101 so as to construct the source packet 103. Asshown in FIG. 2, the source packet header 102 is constructed of a 25-bittime stamp 201 and a 7-bit spare information 202. Time informationshowing transmission timing of the TS packet 101 is described in thetime stamp 201, and the spare information 202 is a region booked for thefuture where 0 is described for all the 7 bits currently. Details on thetime stamp 201 will be described later.

[0016] Next, the CIP data 302 is constructed from the source packet 103.The construction method varies more or less corresponding withtransmission rates of data. FIG. 3 is an example of a constructionmethod of the CIP data 302, and the CIP data 302 are constructed byadding the CIP header 301 to the source packet 103.

[0017] In the case where the transmission rate is low, there is a casethat the source packet 103 is split into 2 units, 4 units or 8 units andCIP headers 301 are added thereto respectively so that the CIP data 302are constructed. However, in this case, in that stream, the number ofunits of splittings cannot be changed.

[0018] In addition, in the case where the transmission rate is high, aplurality of units of the source packet 103 are unified and the CIPheader 301 is added hereto so that the CIP data 302 can be constructed.In this case, inside that stream, the number of units of the sourcepackets 103 included in a unit of the CIP data 302 can be changed.

[0019] Alternatively, or for the purpose of adjusting the transmissionrate, the CIP data 302 can be constructed only of the CIP header 301 aswell. Such a packet, that does not always transmit actual data, is thuscalled “Empty packet”.

[0020] Lastly, as shown in FIG. 4, the isochronous header 402, theheader CRC 403 and the data CRC 404 are added to the CIP data 302 sothat isochronous packet 401 being the transmission format of theIEEE1394 is generated. The header CRC 403 is information for correctingerrors of the isochronous header 402, and the data CRC 404 areinformation for correcting errors of the CIP data 302.

[0021] Incidentally, in the transport stream of the MPEG2, there existsa TS packet including time information (Program Clock Reference=PCR),and when the transmission timing of that packet is deviated, a problemsuch as a color deviation takes place for display subject to decoding,and in some cases, such a case that decoding cannot be executed at allcould take place. Therefore, the receiving party must reproduce the sametiming as the transmitting party.

[0022] However, actually, transmission gitter in the IEEE1394 bus anddelay inside equipment and the like exist, and timing when the receivingparty receives the isochronous packet mostly deviates from the originaltiming as in FIG. 5.

[0023] Under the circumstance, in an IEC61883, the time stamp 201showing the time information is supposed to be added to the sourcepacket header 102 so that the receiving party can reconstruct the timingof the TS packet 101.

[0024] The time stamp 201 for use is a value subject to a certainconstant offset onto the time when the TS packet 101 has arrived at thetransmitter. The receiving party can reproduce the timing of theoriginal stream by outputs to a decoder etc. at the time expressed bythis time stamp 201. At this time, the timing of each TS packet will betiming subject to only delay covering the offset from the originalstream as in FIG. 5.

[0025] The value of the time stamp 201 is expressed with the value ofthe CTR of the IEEE1394. The CTR of the IEEE1394 is constructed of 7-bitSecond_Count, 13-bit Cycle_Count, and 12-bit Cycle_Offset as in FIG. 6,but the value of the time stamp 201 is constructed of the lower 25 bitsamong these, that is, the Cycle_Count and the Cycle_Offset.

[0026] Incidentally, when the TS packet as described above istransmitted with the IEEE1394, for example when the TS packet data areinputted to the transmitting party in real time, it will do if the valueof CTR inside the IEEE1394 interface is taken out at that point of timeand an offset is added thereto to produce the time stamp.

[0027] On the contrary hereto, for example when the TS packet data arestored on a hard disk of a PC and the TS packet data are read out from ahard disk and are transmitted, in order to determine the transmissiontiming of the TS packet, such a method has been proposed that the valueof the time stamp having been added to the TS packet in the transmittingparty in advance is stored in the hard disk together with the TS packetand this time stamp value is utilized to determine the transmissiontiming of the TS packet.

[0028] According to this method, construction of a PC will not becomplicated, and even if a part of or the whole of the IEEE1394interface is constructed of softwares of a PC, the TS packets can betransmitted to the IEEE1394 bus easily.

[0029] That is, in the case where TS packet data are stored on the harddisk of the PC and the TS packet data are read out from the hard diskand are transmitted, it is necessary to detect the value of PCR includedin the TS packet and to reproduce the transmission timing of the TSpackets, and thus the construction will become complicated. However,this proposed method utilizes the value of the stored time stamp todetermine the transmission timing of the TS packet, and therefore, it isnot necessary to detect the PCR and to reproduce the transmission timingof the TS packet, and therefore, as described above, construction of thePC will not get complicated.

[0030] In addition, in the case where a part of or the whole of theIEEE1394 interface is constructed of softwares of the PC and the timestamp has to be produced with softwares, when CTR value is taken outfrom the IEEE1394 interface to give rise to delay, and that delay amountis not constant and cannot be predicted, and therefore it is difficultto produce an exact time stamp. However, according to this method, thevalue of the stored time stamp is utilized to determine the value of thetime stamp to be added to the TS packet, and therefore, even if thewhole of or a part of the IEEE1394 interface is constructed of softwaresof a PC, exact time stamps can be produced.

[0031] In addition, in case of a TS packet having been produced subjectto encoding with a software of a PC, it is necessary to completely newlyproduce and add a value of the time stamp.

[0032] In the case where TS packet data are read out from a hard diskand are transmitted with IEEE1394 as described above, it has to bedetermined how respective TS packets are integrated to an isochronouspacket or how an Empty packet is inserted therein based on value of atime stamp that has been added in advance. However, so far means ofdetermining how integration into an isochronous packet is actuallyexecuted or how an Empty packet is inserted based on value of the addedtime stamp has not been provided.

[0033] That is, there is a problem that there does not exist any meansof determining how TS packets are integrated to an isochronous packet orhow an Empty packet is inserted therein based on value of a time stampthat has been added in advance.

[0034] The present invention has been completed in view of suchconventional problems, and an objective thereof is to providetransmitting apparatuses, transmitting method, packet mode determiningmethods, media and programs that can easily determine how the TS packetdata are transmitted based on the value of the time stamp in the casewhere TS packet data are read out from a hard disk and are transmittedwith IEEE1394.

[0035] In addition, in the case where the TS packet data are producedsubject to encoding with a software of a PC for example, in the casewhere the TS packet data exist on the PC and this TS packet data aregoing to be transmitted with IEEE1394 from the PC, it is necessary thatsuch a time stamp that can specify a transmission timing of the TSpacket is produced in advance.

[0036] However, a PC that can normally transmit with IEEE1394the TSpackets produced subject to encoding with a software of the PC is notknown in the world.

[0037] That is, as for conventional PCs, there is a problem that theredoes not exist any such PC that can normally transmit with IEEE1394those TS packet data in the case where TS packet data exist on a PC.

SUMMARY OF THE INVENTION

[0038] The present invention has been completed in view of suchconventional problems, and an objective thereof is to provide a sourcepacket generating apparatus, source packet generating method, a medium,and a program that can easily produce and add time stamps fortransmitting the TS packet data with IEEE1394 on a PC, and accordinglycan normally transmit with IEEE1394 the TS packet produced on the PC.

[0039] The 1st invention of the present invention is a transmittingapparatus for transmitting a source packet constructed of a pair of dataof a source packet data and a source packet header including a timestamp, comprising:

[0040] transmission packet generating means of investigating values of apredetermined portion of said time stamp included in said source packetwhen said source packet is inputted, unifying said source packets thathave a same value for said predetermined portion and are inputted inseries to output as one unit of transmission packet data; and

[0041] data outputting means of producing a transmission packet byadding predetermined additional information to said outputtedtransmission packet data and outputting said produced transmissionpacket outward.

[0042] The 2nd invention of the present invention is the transmittingapparatus according to 1st invention, wherein said transmission packetgenerating means outputs (N−1) units of dummy transmission packet datato said data outputting means,

[0043] in the case where difference between values of said predeterminedportions of said time stamps included in two source packets inputted inseries is N being N≧2.

[0044] The 3rd invention of the present invention is a transmittingapparatus for transmitting a source packet constructed of a pair of dataof the source packet data and a source packet header including a timestamp, comprising:

[0045] split number designating means of designating a split number M(M≧1) to split said source packet;

[0046] transmission packet generating means of investigating values of apredetermined portion of said time stamp included in said source packetwhen said source packet is inputted,

[0047] outputting said M units split from said source packet astransmission packet data when difference between values of predeterminedportions of said time stamp included in said two source packets inseries is N(N≧0) being N≦L(L≧1), and outputting (N−L) units of dummytransmission packet data when difference between values of saidpredetermined portions of said time stamp is N being N>L; and

[0048] data outputting means of outputting as transmission packetoutward those being said outputted transmission packet data and/or saiddummy transmission packet data to which a predetermined additionalinformation is added.

[0049] The 4th invention of the present invention is the transmittingapparatus according to 3rd invention, wherein said M is 2, 4 or 8.

[0050] The 5th invention of the present invention is the transmittingapparatus according to any of 1st to 4th invenitons, wherein K units ofsaid source packets having variable length or fixed length with K≧1 areinputted as a group to said transmission packet generating means.

[0051] The 6th invention of the present invention is the transmittingapparatus according to any of 1st to 5th inventions,

[0052] wherein said predetermined additional information is a CIPheader, an isochronous header, a header CRC and a data CRC,

[0053] said data outputting means has: a CIP header adding means ofadding said predetermined CIP header to said outputted transmissionpacket data; and

[0054] an IEEE1394 interface for producing said transmission packet byfurther adding said isochronous header, said header CRC and said dataCRC to the transmission packet data to which said predetermined CIPheader is added and outputting said produced transmission packetoutward.

[0055] The 7th invention of the present invention is the transmittingapparatus according to 6th invention, wherein data of said source packetare a transport stream packet of MPEG.

[0056] The 8th invention of the present invention is the transmittingapparatus according to 7th invention, wherein said time stamp isexpressed with Cycle_Count and Cycle_Offset of CycleTimeRegister ofIEEE1394 standards, and

[0057] said predetermined portion is a portion of said Cycle_Count.

[0058] The 9th invention of the present invention is a packet modedetermining method,

[0059] wherein upon receipt of a source packet constructed of a pair ofdata of the source packet data and a source packet header including atime stamp,

[0060] FALSE is substituted for a flag F expressed by TRUE or FALSE, andat the same time, difference N between a value of said time stampincluded in said source packet received immediately prior thereto and avalue of the time stamp included in said source packet received thistime is calculated;

[0061] in the case where N=0 is given, and the flag F expressed by TRUEor FALSE gives F=TRUE, and a first buffer expressed by a pair of twounits of numeric values being (X1, Y1) fulfills X1=1 and Y1>1, after Y1is replaced with (Y1−1), (X1, Y1) being contents of said first buffer isadded to a packet mode list, and moreover X1=2, Y1=1 are substituted forsaid first buffer;

[0062] in the case where N=0 is given, and said flag F is F=TRUE, andthe first buffer expressed by a pair of two units of numeric valuesbeing (X1, Y1) is X1≠1 and/or Y1≦1, X1 is replaced with (X1+1);

[0063] in the case where N=0 is given, and said flag F is F=TRUE, X1 ofthe first buffer expressed by a pair of two units of numeric valuesbeing (X1, Y1) is replaced with (X1+1);

[0064] in the case where N=1, and said flag F is F=FALSE and X2<1, 1 issubstituted for X1 and Y1 is replaced with (Y1+1);

[0065] in the case where N=1, and said flag F is F=FALSE and X2>1, saidflag F is made to constitute F=TRUE and, at the same time, 1 issubstituted for X2 and Y2 is replaced with 1;

[0066] in the case where N=1, and said flag F is F=TRUE and X2=0, Y1 isreplaced with (Y1+1) and, at the same time, 1 is substituted for X2;

[0067] in the case where N=1, and said flag F is F=TRUE and X2>0 andX1=X2, Y1 is replaced with (Y1+1) and, at the same time, 1 issubstituted for X2 and 1 is substituted for Y2;

[0068] in the case where N=1, and said flag F gives F=TRUE, X2>0, X1≠X2,and X2>1, after adding (X1, Y1) being contents of said first buffer tosaid packet mode list, X2 is substituted for X1 and Y2 is substitutedfor Y1 and thereafter 1 is substituted for X2 and 1 is substituted forY2;

[0069] in the case where N=1 is given, and said flag F gives F=TRUE,X2>0, X1≠X2, and X2≦1, after adding (X1, Y1) being contents of saidfirst buffer to said packet mode list, 0 is substituted for X2 and 0 issubstituted for Y2 and thereafter 1 is substituted for X1, 2 issubstituted for Y1 and FALSE is substituted for F;

[0070] in the case where N≧2 is given, and said flag F gives F=FALSE,(X1, Y1) being contents of said first buffer to said packet mode list,and in the case where N≧2 is given, and said flag F gives F=TRUE andX1=X2 is given, Y1 is replaced with (Y+1) and thereafter (X1, Y1) beingcontents of said first buffer is added to said packet mode list;

[0071] in the case where N≧2 is given, and said flag F gives F=TRUE andX1≠X2 is given, (X1, Y1) being contents of said first buffer is added tosaid packet mode list, and moreover (X2, Y2) being contents of saidsecond buffer is added to said packet mode list;

[0072] in the case where N≧2 is given, (0, N−1) is added to said packetmode list and 1.1, 0, 0, and False are substituted for X1, Y1, X2, Y2and F, respectively;

[0073] lastly for each item (K, L) of said packet mode list, in case ofK≧1, K units of said source packets are constructed as one unit oftransmission packet data and L units of said transmission packet dataincluding K units of said source packets are arranged in series; and

[0074] in case of K=0, with dummy data being said transmission packet, Lunits of said dummy data are arranged in series.

[0075] The 10th invention of the present invention is the packet modedetermining method according to 9th invention, wherein N=1, X1=1, andY1=0 in case of initially received said source packet.

[0076] The 11th invention of the present invention is a packet modedetermining method;

[0077] wherein upon receipt of a source packet of T units for one pair(T≧1) constructed of a pair of data of the source packet data and asource packet header including a time stamp,

[0078] in the case where J units (J≧1) of said source packets are insafekeeping in a shunting buffer, a pair of (0, N0−1) is added to apacket mode list only when the kept difference number N0 is N0>1, andthereafter for a first buffer expressed by a pair of two units ofnumeric values being (X1, Y1), J is substituted for X1 and 1 issubstituted for Y1;

[0079] among M units of said source packets, all said source packetsthat have the same value as that in a predetermined portion of said timestamp of said source packet located in the last and that are broughtinto series with said source packet located in the last are stored intosaid shunting buffer;

[0080] the number of units of said source packets stored in saidshunting buffer is substituted for J;

[0081] difference between said time stamp of said source packet of thelast among said source packet that are not stored in said shuntingbuffer and said time stamp of said source packets that is stored in saidshunting buffer is substituted for said kept difference number N0;

[0082] FALSE is substituted for a flag F expressed by TRUE or FALSE andM units of said source packets are checked sequentially from the head;

[0083] difference N between a value of said time stamp included in saidsource packet checked immediately prior thereto and a value of said timestamp included in said source packet checked this time is calculated;

[0084] in the case where N=0 is given, and the flag F expressed by TRUEor FALSE gives F=TRUE, and a first buffer expressed by a pair of twounits of numeric values being (X1, Y1) fulfills X1=1 and Y1>1, after Y1is replaced with (Y1−1), (X1, Y1) being contents of said first buffer isadded to a packet mode list, and moreover X1=2, Y1=1 are substituted forsaid first buffer;

[0085] in the case where N=0 is given, and said flag F is F=TRUE, andthe first buffer expressed by a pair of two units of numeric valuesbeing (X1, Y1) is X1≠1 and/or Y1≦1, X1 is replaced with (X1+1);

[0086] in the case where N=0 is given, and said flag F is F=TRUE, X1 ofthe first buffer expressed by a pair of two units of numeric values of(X1, Y1) is replaced with (X1+1);

[0087] in the case where N=1, and said flag F is F=FALSE and X2≦1, 1 issubstituted for X1 and Y1 is replaced with (Y1+1)

[0088] in the case where N=1, and said flag F is F=FALSE and X2>1, saidflag F is made to constitute F=TRUE and, at the same time, 1 issubstituted for X2 and Y2 is replaced with 1;

[0089] in the case where N=1, and said flag F is F=TRUE and X2=0, Y1 isreplaced with (Y1+1) and, at the same time, 1 is substituted for X2;

[0090] in the case where N=1, and said flag F is F=TRUE and X2>0 andX1=X2, Y1 is replaced with (Y1+1) and, at the same time, 1 issubstituted for X2 and 1 is substituted for Y2;

[0091] in the case where N=1, and said flag F gives F=TRUE, X2>0, X1≠X2,and X2>1, after adding (X1, Y1) being contents of said first buffer tosaid packet mode list, X2 is substituted for X1 and Y2 is substitutedfor Y1 and thereafter 1 is substituted for X2 and 1 is substituted forY2;

[0092] in the case where N=1 is given, and said flag F gives F=TRUE,X2>0, X1≠X2, and X2≦1, after adding (X1, Y1) being contents of saidfirst buffer to said packet mode list, 0 is substituted for X2 and 0 issubstituted for Y2 and thereafter 1 is substituted for X1, 2 issubstituted for Y1 and FALSE is substituted for F;

[0093] in the case where N≧2 is given, and said flag F gives F=FALSE,(X1, Y1) being contents of said first buffer to said packet mode list,(X1, Y1) being contents of said first buffer is added to said packetmode list;

[0094] in the case where N≧2 is given, and said flag F gives F=TRUE andX1=X2 is given, Y1 is replaced with (Y+1) and thereafter; (X1, Y1) beingcontents of said first buffer is added to said packet mode list;

[0095] in the case where N≧2 is given, and said flag F gives F=TRUE andX1≠X2 is given, (X1, Y1) being contents of said first buffer is added tosaid packet mode list, and thereafter moreover (X2, Y2) being contentsof said second buffer is added to said packet mode list;

[0096] in the case where N≧2 is given, after adding (0, N−1) to saidpacket mode list, 1, 1, 0, 0 and FALSE are substituted for X1, Y1, X2,Y2 and F, respectively; and

[0097] after checking on all (T-J) units of said source packets comes toan end,

[0098] in the case where said flag F is F=FALSE, (X1, Y1) being contentsof said first buffer is added to said packet mode list;

[0099] in the case where said flag F gives F=TRUE and X1=X2, after Y1 isreplaced with (Y+1), (X1, Y1) being contents of said first buffer isadded to said packet mode list;

[0100] in the case where said flag F gives F=TRUE and X1=X2, (X1, Y1)being contents of said first buffer is added to said packet mode list;and moreover (X2, Y2) being contents of said second buffer is added tosaid packet mode list;

[0101] lastly for each item (K, L) of said packet mode list, in case ofK≧1, K units of said source packets are constructed as one unit oftransmission packet data and L units of said transmission packet dataincluding K units of said source packets are arranged in series; and

[0102] in case of K=0, with dummy data being said transmission packet, Lunits of said dummy data are arranged in series.

[0103] The 12th invention of the present invention is the packet modedetermining method according to 11th invention, wherein N=1 and J=0 aregiven in case of initially received said source packet, and X1=0 andY1=0 are given in case of said source packet located in the head amountT units of said source packets.

[0104] The 13th invention of the present invention is a packet modedetermining method,

[0105] wherein upon receipt of a source packet constructed of a pair ofdata of the source packet data and a source packet header including atime stamp,

[0106] difference N between a value of said time stamp included in saidsource packet received immediately prior thereto and a value of the timestamp included in said source packet received this time is calculated;

[0107] in the case where said N gives N>(A+1), (N−A−1) units of dummypackets are outputted, and thereafter said source packet received thistime is split into M units and outputted, and at the same time (M−1) issubstituted for A; and

[0108] in the case where said N does not give N>(A+1), said sourcepacket received this time is split into M units and outputted, and atthe same time (M−N) is substituted for A.

[0109] The 14th invention of the present invention is the packet modedetermining method according to 13th invention, wherein N=1 and A=0 incase of initially received said source packet.

[0110] The 15th invention of the present invention is the packet modedetermining method according to 13th invention, wherein said M is avalue designated in advance.

[0111] The 16th invention of the present invention is the packet modedetermining method according to 14th invention, wherein said M is avalue designated in advance.

[0112] The 17th invention of the present invention is the packet modedetermining method according to 13th invention, wherein said M isreceived in a pair with said source packet.

[0113] The 18th invention of the present invention is the packet modedetermining method according to 14th invention, that said M is receivedin a pair with said source packet.

[0114] The 19th invention of the present invention is the packet modedetermining method according to any of 13th to 18th inventions, whereinsaid M is 2, 4 or 8.

[0115] The 20th invention of the present invention is the packet modedetermining method according to any of 9th to 18th inventions, whereindata of said source packet are an MPEG transport stream packet.

[0116] The 21st invention of the present invention is the packet modedetermining method according to 20th invention, wherein said time stampis expressed by Cycle_Count and Cycle_Offset of CycleTimeRegister ofIEEE1394 standards; and

[0117] said difference N is difference between said Cycle_Counts.

[0118] The 22nd invention of the present invention is a source packetgenerating apparatus, comprising:

[0119] packet generating means of generating a data packet transmittedin a first clock and determining transmission timing of said data packetexpressed in said first clock; and

[0120] time information adding means of converting said transmissiontiming to time information on a time axis expressed in a second clock,adding to said data packet the time stamp with a value determined basedon all or a part of said time information and outputting a data packetto which the time stamp is added as a source packet;

[0121] wherein outputted said source packet is converted into a packetfor transmission based on the value of that added time stamp isoutputted from an interface.

[0122] The 23rd invention of the present invention is the source packetgenerating apparatus according to 22nd invention, wherein in the casewhere a predetermined data packet in said data packet is given as afirst data packet and the data packet other than said first data packetin said data packet is given as a second data packet, said timeinformation adding means determines a value of time stamp to be added tosaid second data packet based on a value subject to conversion into timedifference in said second clock from difference in said transmissiontiming in said first clock between said first data packet and saidsecond data packet.

[0123] The 24th invention of the present invention is the source packetgenerating apparatus according to 23rd invention, wherein said timeinformation adding means gives a value of time stamp to be added to saidfirst data packet being 0, and

[0124] gives a value of time stamp to be added to said second datapacket being a value subject to conversion into time difference in saidsecond clock.

[0125] The 25th invention of the present invention is the source packetgenerating apparatus according to 23rd invention, wherein said timeinformation adding means gives a value of time stamp to be added to saidfirst data packet being a predetermined value, and

[0126] gives a value of time stamp to be added to said second datapacket being a value subject to addition of said predetermined valuesubject to conversion into time difference in said second clock.

[0127] The 26th invention of the present invention is the source packetgenerating apparatus according to 23rd inventio, wherein saidpredetermined data packet is a head data packet.

[0128] The 27th invention of the present invention is the source packetgenerating apparatus according to 22nd invention, wherein in the casewhere a data packet adjacent to a third data packet being a data packetwith an already determined value of time stamp is given as a fourth datapacket, said time information adding means gives a value subject toaddition of a value of said time stamp added to said third data packetto a value subject to conversion into time difference in said secondclock from difference in said transmission timing in said first clockbetween said third data packet and said fourth data packet being a valueof said time stamp to be added to fourth data packet.

[0129] The 28th invention of the present invention is the source packetgenerating apparatus according to 27th invention, wherein said timeinformation adding means gives a value of time stamp to be added to ahead data packet in said data packet being a predetermined value.

[0130] The 29th invention of the present invention is the source packetgenerating apparatus according to any of 22nd to 28th inventions,wherein a frequency of said first clock is 27 MHz, and

[0131] said data packet is an MPEG2 transport stream packet.

[0132] The 30th invention of the present invention is the source packetgenerating apparatus according to 29th invneniton, wherein said packetgenerating means outputs said MPEG2 transport stream packet subject toaddition of a dummy time stamp instead of outputting said MPEG2transport stream packet to said time information adding means, and

[0133] said time information adding means replaces said dummy time stampwith the generated said time stamp.

[0134] The 31st invention of the present invention is the source packetgenerating apparatus according to 29th invention, wherein said packetgenerating means receives an MPEG2 program stream packet and generatessaid MPEG2 transport stream packet from said MPEG2 program streampacket.

[0135] The 32nd invention of the present invention is the source packetgenerating apparatus according to 30th inventnion, wherein said packetgenerating means receives an MPEG2 program stream packet and generatessaid MPEG2 transport stream packet from said MPEG2 program streampacket.

[0136] The 33rd invention of the present invention is the source packetgenerating apparatus according to 29th invention, wherein a frequency ofsaid second clock is approximately 24.576 MHz,

[0137] said time information is a value based on CycleTimeRegister inIEEE1394 standards; and

[0138] said time stamp is a time stamp described in a source packetheader in IEC61883.

[0139] The 34th invention of the present invention is the source packetgenerating apparatus according to 22nd invention, wherein said “output”means “output outward”.

[0140] The 35th invention of the present invention is the source packetgenerating apparatus according to 22nd invention, comprising buffermeans of storing a data packet to which said time stamp is added as asource packet, wherein

[0141] said “output” means “write in said buffer”, and

[0142] when a predetermined number of units of said source packets arewritten in, said buffer means

[0143] outputs said predetermined number of units of said sourcepackets.

[0144] The 36th invention of the present invention is a program to causea computer to function as a whole or a part of:

[0145] transmission packet generating means of investigating values of apredetermined portion of said time stamp included in said source packetwhen said source packet is inputted, unifying said source packets thathave the same value for said predetermined portion and are inputted inseries to output as one unit of transmission packet data, and

[0146] data outputting means of producing transmission packet by addingpredetermined additional information to said outputted transmissionpacket data and outputting said produced transmission packet outward,

[0147] of the transmitting apparatus according to 1st invention.

[0148] The 37th invention of the present invention is a program to causea computer to function as a whole or a part of:

[0149] split number designating means of designating a split number M(M≧1) to split said source packet;

[0150] said transmission packet generating means of investigating valuesof a predetermined portion of said time stamp included in said sourcepacket when said source packet is inputted,

[0151] outputting said M units split from said source packet astransmission packet data when difference between values of saidpredetermined portions of said time stamp included in two source packetsin series is N(N≧0) being N≦L(L≧1), and

[0152] outputting (N−L) units of dummy transmission packet data whendifference between values of said predetermined portions of said timestamp is N being N>L; and

[0153] data outputting means of outputting as transmission packetoutward those being said outputted transmission packet data and/or saiddummy transmission packet data to which a predetermined additionalinformation is added;

[0154] of the transmitting apparatus according to 3rd invention.

[0155] The 38th invention of the present invention is a program to causea computer to function as a whole or a part of:

[0156] packet generating means of generating a data packet transmittedin a first clock and determining transmission timing of said data packetexpressed in said first clock; and

[0157] time information adding means of converting said transmissiontiming to time information on a time axis expressed in a second clock,adding to said data packet the time stamp with a value determined basedon all or a part of said time information and outputting a data packetto which the time stamp is added as a source packet;

[0158] of the source packet generating apparatus according to 22ndinvention.

[0159] The 39th invention of the present invention is a medium, that canbe processed by a computer, and that bears a program to cause thecomputer to function as a whole or a part of

[0160] transmission packet generating means of investigating values of apredetermined portion of said time stamp included in said source packetwhen said source packet is inputted, unifying said source packets thathave the same value for said predetermined portion and are inputted inseries to output as one unit of transmission packet data, and

[0161] data outputting means of producing transmission packet by addingpredetermined additional information to said outputted transmissionpacket data and outputting said produced transmission packet outward,

[0162] of the transmitting apparatus according to 1st invention.

[0163] The 40th invention of the present invention is a medium capableof being processed by a computer that bears a program to cause thecomputer to function as a whole or a part of

[0164] split number designating means of designate a split number M(M≧1) to split said source packet;

[0165] said transmission packet generating means of investigating valuesof a predetermined portion of said time stamp included in said sourcepacket when said source packet is inputted,

[0166] outputting said M units split from said source packet astransmission packet data when difference between values of saidpredetermined portions of said time stamp included in two source packetsin series is N(N≧0) being N≦L(L≧1), and

[0167] outputting (N−L) units of dummy transmission packet data whendifference between values of said predetermined portions of said timestamp is N being N>L; and

[0168] data outputting means of outputting as transmission packetoutward those being said outputted transmission packet data and/or saiddummy transmission packet data to which a predetermined additionalinformation is added,

[0169] of the transmitting apparatus according to 3rd invention.

[0170] The 41st invention of the present invention is a medium capableof being processed by a computer that bears a program to cause thecomputer to function as a whole or a part of

[0171] packet generating means of generating a data packet transmittedin a first clock and determining transmission timing of said data packetexpressed in said first clock; and

[0172] time information adding means of converting said transmissiontiming to time information on a time axis expressed in a second clock,adding to said data packet the time stamp with a value determined basedon all or a part of said time information and outputting a data packetto which the time stamp is added as a source packet;

[0173] of the source packet generating apparatus according to 22ndinvention.

[0174] The 42nd invention of the present invention is a program to causea computer to execute all or a part of the steps, in the packet modedetermining method according to 9th invention of:

[0175] upon receipt of a source packet constructed of a pair of data ofthe source packet data and a source packet header including a timestamp,

[0176] substituting FALSE for a flag F expressed by TRUE or FALSE, andat the same time, calculating difference N between a value of said timestamp included in said source packet received immediately prior theretoand a value of the time stamp included in said source packet receivedthis time;

[0177] in the case where N=0 is given, and the flag F expressed by TRUEor FALSE gives F=TRUE, and a first buffer expressed by a pair of twounits of numeric values being (X1, Y1) fulfills X1=1 and Y1>1, after Y1is replaced with (Y1−1), adding (X1, Y1) being contents of said firstbuffer to a packet mode list, and moreover substituting X1=2, Y1=1 forsaid first buffer;

[0178] in the case where N=0 is given, and said flag F is F=TRUE, andthe first buffer expressed by a pair of two units of numeric values of(X1, Y1) is X1≠1 and/or Y1≦1, replacing X1 with (X1+1);

[0179] in the case where N=0 is given, and said flag F is F=TRUE,replacing X1 of the first buffer expressed by a pair of two units ofnumeric values (X1, Y1) with (X1+1);

[0180] in the case where N=1, and said flag F is F=FALSE and X2≦1,substituting 1 for X1 and replacing Y1 with (Y1+1);

[0181] in the case where N=1, and said flag F is F=FALSE and X2>1,making said flag F constitute F=TRUE and, at the same time, substituting1 for X2 and 1 for Y2;

[0182] in the case where N=1, and said flag F is F=TRUE and X2=0,replacing Y1 with (Y1+1) and, at the same time, substituting 1 for X2;

[0183] in the case where N=1, and said flag F is F=TRUE and X2>0 andX1=X2, replacing Y1 with (Y1+1) and, at the same time, substituting 1for X2 and 1 for Y2 respectively;

[0184] in the case where N=1, and said flag F gives F=TRUE, X2>0, X1≠X2,and X2>1, after adding (X1, Y1) being contents of said first buffer tosaid packet mode list, substituting X2 for X1 and Y2 for Y1 respectivelyand thereafter substituting 1 for X2 and 1 for Y2;

[0185] in the case where N=1 is given, and said flag F gives F=TRUE,X2>0, X1≠X2, and X2≦1, after adding (X1, Y1) being contents of saidfirst buffer to said packet mode list, substituting 0 for X2 and 0 forY2 and thereafter substituting 1 for X1, 2 for Y1 and FALSE for F;

[0186] in the case where N≧2 is given, and said flag F gives F=FALSE,adding (X1, Y1) being contents of said first buffer to said packet modelist,

[0187] in the case where N≧2 is given, and said flag F gives F=TRUE andX1=X2 is given, replacing Y1 with (Y+1) and thereafter adding (X1, Y1)being contents of said first buffer to said packet mode list;

[0188] in the case where N≧2 is given, and said flag F gives F=TRUE andX1≠X2 is given, adding (X1, Y1) being contents of said first buffer tosaid packet mode list, and thereafter moreover adding (X2, Y2) beingcontents of said second buffer to said packet mode list;

[0189] in the case where N≧2 is given, adding (0, N−1) to said packetmode list and thereafter substituting 1 for X1, 1 for Y1, 0 for X2, 0for Y2 and FALSE for F respectively;

[0190] lastly for each item (K, L) of said packet mode list, in case ofK≧1, constructing K units of said source packets as one unit oftransmission packet data and arranging in series L units of saidtransmission packet data including K units of said source packets; and

[0191] in case of K=0, with dummy data being said transmission packet,arranging in series L units of said dummy data.

[0192] The 43rd invention of the present invention is a program to causea computer to execute all or a part of the steps, in the packet modedetermining method according to 11th invention of:

[0193] upon receipt of a source packet of T units for one pair (T≧1)constructed of a pair of data of the source packet data and a sourcepacket header including a time stamp, of the packet mode determiningmethod according to 11th, all or a part of:

[0194] in the case where J units (J≧1) of said source packets are insafekeeping in a shunting buffer, adding a pair of (0, N0−1) to a packetmode list only when the kept difference number N0 is N0>1, andthereafter for a first buffer expressed by a pair of two units ofnumeric values being (X1, Y1), substituting J for X1 and 1 for Y1;

[0195] among M units of said source packets, storing into said shuntingbuffer all said source packets that have the same value as that in apredetermined portion of said time stamp of said source packet locatedin the last and that are brought into series with said source packetlocated in the last;

[0196] submitting the number of units of said source packets stored insaid shunting buffer for J; and

[0197] after substituting, for said kept difference number N0,difference between said time stamp of said source packet of the lastamong said source packets that are not stored in said shunting bufferand said time stamp of said source packet that is stored in saidshunting buffer,

[0198] substituting FALSE for a flag F expressed by TRUE or FALSE andchecking M units of said source packets sequentially from the head;

[0199] calculating difference N between a value of said time stampincluded in said source packet checked immediately prior thereto and avalue of said time stamp included in said source packet checked thistime;

[0200] in the case where N=0 is given, and the flag F expressed by TRUEor FALSE gives F=TRUE, and a first buffer expressed by a pair of twounits of numeric values being (X1, Y1) fulfills X1=1 and Y1>1, after Y1is replaced with (Y1−1), adding (X1, Y1) being contents of said firstbuffer to a packet mode list, and moreover substituting X1=2, Y1=1 forsaid first buffer;

[0201] in the case where N=0 is given, and said flag F is F=TRUE, andthe first buffer expressed by a pair of two units of numeric values of(X1, Y1) is X1≠1 and/or Y1≦1, replacing X1 with (X1+1);

[0202] in the case where N=0 is given, and said flag F is F=TRUE,replacing X1 of the first buffer expressed by a pair of two units ofnumeric values of (X1, Y1) with (X1+1);

[0203] in the case where N=1, and said flag F is F=FALSE and X2≦1,substituting 1 for X1 and replacing Y1 with (Y1+1);

[0204] in the case where N=1, and said flag F is F=FALSE and X2>1,making said flag F constitute F=TRUE, and at the same time, substituting1 for X2 and replacing Y2 with 1;

[0205] in the case where N=1, and said flag F is F=TRUE and X2=0,replacing Y1 with (Y1+1), and at the same time, substituting 1 for X2;

[0206] in the case where N=1, and said flag F is F=TRUE and X2>0 andX1=X2, replacing Y1 with (Y1+1), and at the same time, substituting 1for X2 and 1 for Y2 respectively;

[0207] in the case where N=1, and said flag F gives F=TRUE, X2>0, X1≠X2,and X2>1, after adding (X1, Y1) being contents of said first buffer tosaid packet mode list, substituting X2 for X1 and Y2 for Y1 respectivelyand thereafter substituting 1 for X2 and 1 for Y2;

[0208] in the case where N=1 is given, and said flag F gives F=TRUE,X2>0, X1≠X2, and X2≦1, after adding (X1, Y1) being contents of saidfirst buffer to said packet mode list, substituting 0 for X2 and 0 forY2 and thereafter substituting 1 for X1, 2 for Y1 and FALSE for F;

[0209] in the case where N≧2 is given, and said flag F gives F=FALSE,adding (X1, Y1) being contents of said first buffer to said packet modelist;

[0210] in the case where N≧2 is given, and said flag F gives F=TRUE andX1=X2 is given, replacing Y1 with (Y+1) and thereafter adding (X1, Y1)being contents of said first buffer to said packet mode list;

[0211] in the case where N≧2 is given, and said flag F gives F=TRUE andX1≠X2 is given, adding (X1, Y1) being contents of said first buffer tosaid packet mode list, and thereafter moreover adding (X2, Y2) beingcontents of said second buffer to said packet mode list;

[0212] in the case where N≧2 is given, arranging to add (0, N−1) to saidpacket mode list and thereafter substituting 1 for X1, 1 for Y1, 0 forX2, 0 for Y2 and FALSE for F respectively; and

[0213] after checking on all (T-J) units of said source packets comingto an end;

[0214] in the case where said flag F is F=FALSE, a step to add (X1, Y1)being contents of said first buffer to said packet mode list;

[0215] in the case where said flag F gives F=TRUE and X1=X2, after Y1 isreplaced with (Y1+1), adding (X1, Y1) being contents of said firstbuffer to said packet mode list;

[0216] in the case where said flag F gives F=TRUE and X1≠X2, adding (X1,Y1) being contents of said first buffer to said packet mode list, andmoreover adding (X2, Y2) being contents of said second buffer to saidpacket mode list;

[0217] lastly for each item (K, L) of said packet mode list, in case ofK≧1, constructing K units of said source packets as one unit oftransmission packet data and arranging in series L units of saidtransmission packet data including K units of said source packets; and

[0218] in case of K=0, with dummy data being said transmission packet,arranging in series L units of said dummy data.

[0219] The 44th invention of the present invention is a program to causea computer to execute all or a part of the steps, in the packet modedetermining method according to 13th invention, of:

[0220] upon receipt of a source packet constructed of a pair of data ofthe source packet data and a source packet header including a timestamp,

[0221] calculating difference N between a value of said time stampincluded in said source packet received immediately prior thereto and avalue of the time stamp included in said source packet received thistime;

[0222] in the case where said N gives N>(A+1), outputting (N−A−1) unitsof dummy packets, and thereafter splitting said source packet receivedthis time into M units and outputting them, and at the same timesubstituting (M−1) for A;

[0223] in the case where said N does not give N>(A+1), splitting saidsource packet received this time into M units and outputting them, andat the same time substituting (M−N) for A.

[0224] The 45th invention of the present invention is a medium capableof being processed by a computer that bears a program to cause acomputer to execute all or a part of the steps, in the packet modedetermining method according to 9th invention, of:

[0225] upon receipt of a source packet constructed of a pair of data ofthe source packet data and a source packet header including a timestamp,

[0226] substituting FALSE for a flag F expressed by TRUE or FALSE, andat the same time, calculating difference N between a value of said timestamp included in said source packet received immediately prior theretoand a value of the time stamp included in said source packet receivedthis time;

[0227] in the case where N=0 is given, and the flag F expressed by TRUEor FALSE, gives F=TRUE, and a first buffer expressed by a pair of twounits of numeric values being (X1, Y1) fulfills X1=1 and Y1>1, after Y1is replaced with (Y1−1) adding (X1, Y1) being contents of said firstbuffer to a packet mode list, and moreover substituting X1=2, Y1=1 forsaid first buffer;

[0228] in the case where N=0 is given, and said flag F is F=TRUE, andthe first buffer expressed by a pair of two units of numeric values of(X1, Y1) is X1≠1 and/or Y1<1, replacing X1 with (X1+1);

[0229] in the case where N=0 is given, and said flag F is F=TRUE,replacing X1 of the first buffer expressed by a pair of two units ofnumeric values (X1, Y1) with (X1+1);

[0230] in the case where N=1, and said flag F is F=FALSE and X2≦1,substituting 1 for X1 and replacing Y1 with (Y1+1);

[0231] in the case where N=1, and said flag F is F=FALSE and X2>1,making said flag F constitute F=TRUE and, at the same time, substituting1 for X2 and 1 for Y2;

[0232] in the case where N=1, and said flag F is F=TRUE and X2=0,replacing Y1 with (Y1+1) and, at the same time, substituting 1 for X2;

[0233] in the case where N=1, and said flag F is F=TRUE and X2>0 andX1=X2, replacing Y1 with (Y1+1) and, at the same time, substituting 1for X2 and 1 for Y2 respectively;

[0234] in the case where N=1, and said flag F gives F=TRUE, X2>0, X1≠X2,and X2>1, after adding (X1, Y1) being contents of said first buffer tosaid packet mode list, substituting X2 for X1 and Y2 for Y1 respectivelyand thereafter substituting 1 for X2 and 1 for Y2;

[0235] in the case where N=1 is given, and said flag F gives F=TRUE,X2>0, X1≠X2, and X2≦1, after adding (X1, Y1) being contents of saidfirst buffer to said packet mode list, substituting 0 for X2 and 0 forY2 and thereafter substituting 1 for X1, 2 for Y1 and FALSE for F;

[0236] in the case where N≧2 is given, and said flag F gives F=FALSE,adding (X1, Y1) being contents of said first buffer to said packet modelist;

[0237] in the case where N≧2 is given, and said flag F gives F=TRUE andX1=X2 is given, replacing Y1 with (Y+1) and thereafter adding (X1, Y1)being contents of said first buffer to said packet mode list;

[0238] in the case where N≧2 is given, and said flag F gives F=TRUE andX1≠X2 is given, adding (X1, Y1) being contents of said first buffer tosaid packet mode list, and thereafter moreover adding (X2, Y2) beingcontents of said second buffer to said packet mode list;

[0239] in the case where N≧2 is given, adding (0, N−1) to said packetmode list and thereafter substituting 1 for X1, 1 for Y1, 0 for X2, 0for Y2 and FALSE for F respectively;

[0240] lastly for each item (K, L) of said packet mode list, in case ofK≧1, constructing K units of said source packets as one unit oftransmission packet data and arranging in series L units of saidtransmission packet data including K units of said source packets; and

[0241] in case of K=0, with dummy data being said transmission packet,arranging in series L units of said dummy data.

[0242] The 46th invention of the present invention is a medium capableof being processed by a computer that bears a program to cause acomputer to execute all or a part of the steps, in the packet modedetermining method according to 11th inventinno of: upon receipt of asource packet of T units for one pair (T≧1) constructed of a pair ofdata of the source packet data and a source packet header including atime stamp,

[0243] in the case where J units (J≧1) of said source packets are insafekeeping in a shunting buffer, adding a pair of (0, N0−1) to a packetmode list only when the kept difference number N0 is N0>1, andthereafter for a first buffer expressed by a pair of two units ofnumeric values being (X1, Y1), substituting J for X1 and 1 for Y1;

[0244] among M units of said source packets, storing into said shuntingbuffer all said source packets that have the same value as that in apredetermined portion of said time stamp of said source packet locatedin the last and that are brought into series with said source packetlocated in the last;

[0245] substituting the number of units of said source packets stored insaid shunting buffer for J;

[0246] after substituting, for said kept difference number N0,difference between said time stamp of said source packet of the lastamong said source packets that are not stored in said shunting bufferand said time stamp of said source packet that is stored in saidshunting buffer;

[0247] substituting FALSE for a flag F expressed by TRUE or FALSE andchecking M units of said source packets sequentially from the head;

[0248] calculating difference N between a value of said time stampincluded in said source packet checked immediately prior thereto and avalue of said time stamp included in said source packet checked thistime;

[0249] in the case where N=0 is given, and the flag F expressed by TRUEor FALSE gives F=TRUE, and a first buffer expressed by a pair of twounits of numeric values being (X1, Y1) fulfills X1=1 and Y1>1, after Y1is replaced with (Y1−1) adding (X1, Y1) being contents of said firstbuffer to a packet mode list, and moreover substitute X1=2, Y1=1 forsaid first buffer;

[0250] in the case where N=0 is given, and said flag F is F=TRUE, andthe first buffer expressed by a pair of two units of numeric values of(X1, Y1) is X1≠1 and/or Y1≦1, replacing X1 with (X1+1)

[0251] in the case where N=0 is given, and said flag F is F=TRUE,replacing X1 of the first buffer expressed by a pair of two units ofnumeric values of (X1, Y1) with (X1+1);

[0252] in the case where N=1, and said flag F is F=FALSE and X2≦1,substituting 1 for X1 and replacing Y1 with (Y1+1);

[0253] in the case where N=1, and said flag F is F=FALSE and X2>1, astep to make said flag F constitute F=TRUE and, at the same time,substituting 1 for X2 and 1 for Y2;

[0254] in the case where N=1, and said flag F is F=TRUE and X2=0,replacing Y1 with (Y1+1) and, at the same time, substituting 1 for X2;

[0255] in the case where N=1, and said flag F is F=TRUE and X2>0 andX1=X2, replacing Y1 with (Y1+1) and, at the same time, substituting 1for X2 and 1 for Y2 respectively;

[0256] in the case where N=1, and said flag F gives F=TRUE, X2>0, X1≠X2,and X2>1, after adding (X1, Y1) being contents of said first buffer tosaid packet mode list, substituting X2 for X1 and Y2 for Y1 respectivelyand thereafter substituting 1 for X2 and 1 for Y2;

[0257] in the case where N=1 is given, and said flag F gives F=TRUE,X2>0, X1≠X2, and X2≦1, after adding (X1, Y1) being contents of saidfirst buffer to said packet mode list, substituting 0 for X2 and 0 forY2 and thereafter substituting 1 for X1, 2 for Y1 and FALSE for F;

[0258] in the case where N≧2 is given, and said flag F gives F=FALSE,(X1, Y1) being contents of said first buffer to said packet mode list,adding (X1, Y1) being contents of said first buffer to said packet modelist;

[0259] in the case where N≧2 is given, and said flag F gives F=TRUE andX1=X2 is given, replacing Y1 with (Y+1) and thereafter adding (X1, Y1)being contents of said first buffer to said packet mode list;

[0260] in the case where N≧2 is given, and said flag F gives F=TRUE andX1≠X2 is given, adding (X1, Y1) being contents of said first buffer tosaid packet mode list, and thereafter moreover adding (X2, Y2) beingcontents of said second buffer to said packet mode list;

[0261] in the case where N≧2 is given, arranging to add (0, N−1) to saidpacket mode list and thereafter substituting 1 for X1, 1 for Y1, 0 forX2, 0 for Y2 and FALSE for F respectively; and

[0262] after checking on all (T-J) units of said source packets comingto an end,

[0263] in the case where said flag F is F=FALSE, adding (X1, Y1) beingcontents of said first buffer to said packet mode list;

[0264] in the case where said flag F gives F=TRUE and X1=X2, after Y1 isreplaced with (Y1+1), adding (X1, Y1) being contents of said firstbuffer to said packet mode list;

[0265] in the case where said flag F gives F=TRUE and X1≠X2, adding (X1,Y1) being contents of said first buffer to said packet mode list, andmoreover adding (X2, Y2) being contents of said second buffer to saidpacket mode list;

[0266] lastly for each item (K, L) of said packet mode list, in case ofK≧1, constructing K units of said source packets as one unit oftransmission packet data and arranging in series L units of saidtransmission packet data including K units of said source packets; and

[0267] in case of K=0, with dummy data being said transmission packet,arranging in series L units of said dummy data.

[0268] The 47th invention of the present invention is a medium capableof being processed by a computer that bears a program to cause acomputer to execute all or a part of the steps, in the packet modedetermining method according to 13th invention, of:

[0269] upon in receipt of a source packet constructed of a pair of dataof the source packet data and a source packet header including a timestamp,

[0270] calculating difference N between a value of said time stampincluded in said source packet received immediately prior thereto and avalue of the time stamp included in said source packet received thistime;

[0271] in the case where said N gives N>(A+1), outputting (N−A−1) unitsof dummy packets, and thereafter splitting said source packet receivedthis time into M units and outputting them, and at the same timesubstituting (M−1) for A;

[0272] in the case where said N does not give N>(A+1), splitting saidsource packet received this time into M units and outputting them, andat the same time substituting (M−N) for A.

[0273] The 48th invention of the present invention is a transmittingmethod for transmitting a source packet constructed of a pair of data ofa source packet data and a source packet header including a time stamp,comprising:

[0274] a step of investigating values of a predetermined portion of saidtime stamp included in said source packet when said source packet isinputted, unifying said source packets that have a same value for saidpredetermined portion and are inputted in series to output as one unitof transmission packet data; and

[0275] a step of producing a transmission packet by adding predeterminedadditional information to said outputted transmission packet data andoutputting said produced transmission packet outward.

[0276] The 49th invention of the present invention is a transmittingmethod for transmitting a source packet constructed of a pair of data ofthe source packet data and a source packet header including a timestamp, comprising:

[0277] a step of split number designating means of designating a splitnumber M (M≧1) to split said source packet;

[0278] a step of investigating values of a predetermined portion of saidtime stamp included in said source packet when said source packet isinputted,

[0279] outputting said M units split from said source packet astransmission packet data when difference between values of predeterminedportions of said time stamp included in said two source packets inseries is N(N≧0) being N≦L(L≧1), and

[0280] outputting (N−L) units of dummy transmission packet data whendifference between values of said predetermined portions of said timestamp is N being N>L; and

[0281] a step of outputting as transmission packet outward those beingsaid outputted transmission packet data and/or said dummy transmissionpacket data to which a predetermined additional information is added.

[0282] The 50th invention of the present invention is a source packetgenerating method, comprising:

[0283] a step of generationg a data packet transmitted in a first clock,and determining transmission timing of said data packet expressed insaid first clock; and

[0284] a step of converting said transmission timing to time informationon a time axis expressed in a second clock, adding to said data packetthe time stamp with a value determined based on all or a part of saidtime information and outputting a data packet to which the time stamp isadded as a source packet;

[0285] wherein outputted said source packet is converted into a packetfor transmission based on the value of that added time stamp isoutputted from an interface.

BRIEF DESCRIPTION OF THE DRAWINGS

[0286]FIG. 1

[0287]FIG. 1 is a drawing showing a construction of a source packet fortransmitting an MPEG2 TS packet in IEC61883.

[0288]FIG. 2

[0289]FIG. 2 is a drawing showing a construction of a source packetheader 102.

[0290]FIG. 3

[0291]FIG. 3 is a drawing showing an example of a construction of a CIP.

[0292]FIG. 4

[0293]FIG. 4 is a drawing showing a construction of isochronous packetfor transmitting CIP data 302.

[0294]FIG. 5

[0295]FIG. 5 is a conceptional view of transmission timing of TS packets101.

[0296]FIG. 6

[0297]FIG. 6 is a drawing showing a construction of CTR in IEEE1394.

[0298]FIG. 7

[0299]FIG. 7 is a drawing showing an example of transmitting apparatusin a first Embodiment of the present invention.

[0300]FIG. 8

[0301]FIG. 8 is a drawing showing an example of a construction of datafile stored in a hard disk 704.

[0302]FIG. 9

[0303]FIG. 9 is a drawing showing an example of source packet data readout from a hard disk 706.

[0304]FIG. 10

[0305]FIG. 10 is a drawing showing a construction of CIP data producedfrom the source packet data in FIG. 9.

[0306]FIG. 11

[0307]FIG. 11 is a flowchart showing operations of a time stamp samplejudging part 705 in a second Embodiment of the present invention.

[0308]FIG. 12

[0309]FIG. 12 is a flowchart showing operations of a time stamp samplejudging part 705 in the second Embodiment of the present invention.

[0310]FIG. 13

[0311]FIG. 13 is a flowchart showing operations of a time stamp samplejudging part 705 in the second Embodiment of the present invention.

[0312]FIG. 14

[0313]FIG. 14 is a drawing showing an example of output results oftransmission packet mode list 1101 in the second Embodiment of thepresent invention.

[0314]FIG. 15

[0315]FIG. 15 is a flowchart showing operations of a time stamp samplejudging part 705 in a third Embodiment of the present invention.

[0316]FIG. 16

[0317]FIG. 16 is a drawing showing an example of output results oftransmission packet mode list 1101 in the third Embodiment of thepresent invention.

[0318]FIG. 17

[0319]FIG. 17 is a drawing showing an example of output results oftransmission packet mode list 1101 in the third Embodiment of thepresent invention.

[0320]FIG. 18

[0321]FIG. 18 is a drawing showing an example of transmitting apparatusin a fourth Embodiment of the present invention.

[0322]FIG. 19

[0323]FIG. 19 is a drawing showing an example of a splitting method of asource packet 103 a.

[0324]FIG. 20

[0325]FIG. 20 is a drawing showing an example of a source packet dataread out from a hard disk 706.

[0326]FIG. 21

[0327]FIG. 21 is a drawing showing a construction of CIP data producedfrom source packet data in FIG. 18.

[0328]FIG. 22

[0329]FIG. 22 is a flowchart showing operations of a time stamp samplejudging part 1604 in a fifth Embodiment of the present invention.

[0330]FIG. 23

[0331]FIG. 23 is a drawing showing an example of output results oftransmission packet mode list 1101 in the fifth Embodiment of thepresent invention.

[0332]FIG. 24

[0333]FIG. 24 is a drawing showing an example of a source packetgenerating apparatus in a sixth Embodiment.

[0334]FIG. 25

[0335]FIG. 25 is a drawing showing an example of a generating method ofa time stamp 201.

[0336]FIG. 26

[0337]FIG. 26 is a drawing showing an example of a source packetgenerating apparatus in a seventh Embodiment.

DESCRIPTION OF SYMBOLS

[0338]101 . . . TS packet

[0339]102 . . . source packet header

[0340]103 . . . source packet

[0341]201 . . . time stamp

[0342]202 . . . spare information

[0343]301 . . . CIP header

[0344]302 . . . CIP data

[0345]401 . . . isochronous packet

[0346]402 . . . isochronous header

[0347]403 . . . header CRC

[0348]404 . . . data CRC

[0349]601 . . . CTR

[0350]701 . . . PC

[0351]702 . . . IEEE1394 interface

[0352]703 . . . CIP producing part

[0353]704 . . . data reading part

[0354]705 . . . time stamp sample judging part

[0355]706 . . . hard disk

[0356]707 . . . IEEE1394 bus

[0357]708 . . . receiving apparatus

[0358]801 . . . header

[0359]802 . . . trailer

[0360]1101 . . . transmission packet mode list

[0361]1301 . . . buffer for final difference value

[0362]1302 . . . shunting buffer

[0363]1601 . . . PC

[0364]1601 . . . PC

[0365]1602 . . . CIP producing part

[0366]1603 . . . split number designating part

[0367]1604 . . . time stamp sample judging part

[0368]1701 a 1, 1701 a 2 . . . split block

[0369]2401 . . . time stamp adding part

[0370]2402 . . . TS packet generating part

[0371]2403 . . . data reading part

[0372]2404 . . . transmitting part

[0373]2405 . . . hard disk

[0374]2406 . . . PC

[0375]2407 . . . time information

[0376]2408 . . . PS packet

[0377]2601 . . . buffer

[0378]2602 . . . transmitting part

PREFERRED EMBODIMENTS OF THE INVENTION

[0379] Embodiments of the present invention will be described withreference to drawings as follows.

First Embodiment

[0380] A first Embodiment of the present invention will be describedwith reference to FIGS. 7 to 10 as follows.

[0381]FIG. 7 is an example of a transmitting apparatus. In FIG. 7,reference numeral 701 denotes a PC, reference numeral 702 does anIEEE1394 interface, reference numeral 703 does a CIP producing part,reference numeral 704 does a data reading part, reference numeral 705does a time stamp sample judging part, reference numeral 706 does a harddisk, reference numeral 707 does an IEEE1394 bus and reference numeral708 does a receiving apparatus.

[0382]FIG. 8 is an example of record format of TS packets 101 in thehard disk 706. In FIG. 8, reference numeral 801 denotes a header andreference numeral 802 denotes a trailer.

[0383]FIG. 9 is an example of source packet data read out from the harddisk 706.

[0384]FIG. 10 is a construction of a CIP produced from the source packetdata in FIG. 9.

[0385] Incidentally, the PC 701 of the present embodiment is an exampleof the transmitting apparatus of the present invention.

[0386] Now, operations of the PC 701 will be described.

[0387] At first in the hard disk 706, TS packet data are stored in aformat as in FIG. 8. That is, in the hard disk 706, a time stamp thatthe transmitting party of the TS packet data has added to the TS packetdata is stored together.

[0388] The data reading part 704 reads out the source packet 103, thatis, a pair of a source packet header 102 and a TS packet 101 from thehard disk 706 so as to output to the CIP producing part 703 and the timestamp sample judging part 705.

[0389] The time stamp sample judging part 705 extracts the time stamp201 from the received source packet header 102, notifies the CIPproducing part 703 which one is the source packet 103 that has the samevalue as the Cycle_Count of the time stamp 201 and is brought intoconnection in series, and instructs those source packets to get togetherto construct one CIP data.

[0390] For example, in case of FIG. 9, it detects that the source packet103 a and the source packet 103 b have the same Cycle_Count and arebrought into connection in series and sends out an instruction to theCIP producing part 703.

[0391] The CIP producing part 902 produces CIP data 302 to output themto an IEEE1394 interface 901 from the received source packet 103according to the method that has been described in the prior arts.

[0392] For example, it connects the source packet 103 a with the sourcepacket 103 b and adds a CIP header 301 a to the head thereof to beoutputted to the IEEE1394 interface 702 as CIP data 302 a.

[0393] In addition, the time stamp sample judging part 705 brings theCycle_Count of the extracted time stamp 201 and the Cycle_Count of thetime stamp 201 included in the immediately prior source packet 103 intocomparison and instructs to insert (N−1) units of Empty packets betweenthose source packets in the case where the difference N between both theparties is 2 or more.

[0394] The CIP producing party 703 receives an instruction to insert theEmpty packet, and then produces the CIP data 302 constructed only of theCIP header 301 to output them to the IEEE1394 interface 702.

[0395] For example, in case of FIG. 9, the difference between theCycle_Count of the time stamp included in the source packet 103 c andthe Cycle_Count of the time stamp included in the source packet 103 d is2, and therefore the CIP producing part 703 is instructed to insert oneEmpty packet between those source packets.

[0396] The IEEE1394 interface 702 adds an isochronous header 402, aheader CRC 403 and data CRC 404 to the received CIP data 302 as in FIG.4 so as to create isochronous packet 401 for an output to an IEEE1394bus 706.

[0397] The outputted isochronous packet 401 is received, for example, bythe receiving apparatus 708.

[0398] As described so far, the isochronous packet 401 is constructedfrom the TS packet data stored in the hard disk 706 and can be outputtedto the IEEE1394 bus 706.

[0399] Incidentally, the source packet 103 has been taken as the onestored in the hard disk 706, but a pair of the TS packet 101 and thetime stamp 201 will do as well or another time information created fromthe time stamp 201 instead of the time stamp 201 will do as well. Inthis case, the time stamp 201 as well as the source packet header 102are produced in the data reading part 704.

[0400] In addition, the data file on the hard disk 704 may be stored inan AVI file format, an ASF file format, or a QuickTime file format, ormay not store additional information such as a header and a trailer.

[0401] In addition, the source packet header 102 and the TS packet 101may not be stored in order as in FIG. 8.

[0402] In addition, the data to be transmitted are not limited to aMPEG2 TS packet, but a source packet including a source packet headerwill do.

[0403] In addition, those outputting the source packet are not limitedto a hard disk, but may be another recording apparatus, and an apparatusconverting the MPEG2 data other than the TS packet format into the TSpacket format will do as well.

[0404] In addition, a part of or the whole transmitting apparatus maybeconstructed of softwares, or the transmitting apparatus may not be a PC.

Second Embodiment

[0405] An example of operations of the time stamp sample judging part705 in the first Embodiment of the present invention will be describedas a second Embodiment of the present invention with reference to FIGS.11 to 14 as follows.

[0406] FIGS. 11 to 13 are flowcharts describing operations of the timestamp sample judging part 705. In FIGS. 11 to 13, reference numeral 1101denotes a transmission packet mode list.

[0407]FIG. 14 exemplifies output results of the transmission packet modelist 1101.

[0408] Here, the transmission packet mode list 1101 is a list of numericvalues of a pair consisting of two units being (X, Y), wherein referencecharacter X denotes the number of units of source packets 103constructing one CIP data 302 while reference character Y denotes howmany CIP data 302 constructed of X units of source packets 103 arearranged in series respectively. X=0 means an Empty packet.

[0409] With the above described mode list 1101 being produced, the timestamp sample judging part 705 operates as described in the firstEmbodiment.

[0410] In addition, in FIGS. 11 to 13, the description “X1=1;” meansthat 1 is substituted for X1.

[0411] Operations of the time stamp sample judging part 705 will bedescribed as follows.

[0412] As an initial state prior to receipt of the source packet 103,X1=1, Y1=0, X2=0 and Y2=0 shall be adopted for substitution.

[0413] At first, upon receipt of the source packet 103, processingstarts in Step 101, a time stamp of the source packet receivedimmediately prior thereto in Step 102 and the time stamp of the sourcepacket received this time are extracted so that the difference N betweentheir respective Cycle_Count values is acquired. In case of theinitially received source packet, N=1 shall be taken. At the same timeas this, FALSE is substituted for a flag F.

[0414] In Step 103, a value of N is judged and in case of N=0, the stepgoes forward to Step 104, in case of N=1, to Step 112 and in case ofN≧2, to Step 125.

[0415] Moreover, in Step 104, the value of the flag F is judged and incase of F=TRUE, the step goes forward to Step 105 while in case ofF=FALSE, the step goes forward to Step 106.

[0416] In Step 105, X2+1 is substituted for X2 so that the step goesforward to Step 111.

[0417] In Step 106, the values of X1 and Y1 are judged, and in case ofX=1 and Y1>1, the step goes forward to Step 108, and otherwise the stepgoes forward to Step 107.

[0418] In Step 107, X1+1 is substituted for X1 and the step goes forwardto Step 111.

[0419] In Step 108, Y1−1 is substituted for Y1, and (X1, Y1) is added tothe transmission packet mode list 1101 in Step 109 so that 2 issubstituted for. X1 and 1 is for Y1 in Step 110 respectively and thestep goes forward to Step 111.

[0420] In addition, in Step 112, judging the value of the flag F, thestep goes forward to Step 113 in case of F=FALSE while the step goesforward to Step 116 in case of F=TRUE.

[0421] Moreover, in Step 113, the value of X1 is judged, and in case ofX1≦1, the step goes forward to Step 114, and otherwise the step goesforward to Step 115.

[0422] In Step 114, 1 is substituted for X1 and Y1+1 is for Y1, and thestep goes forward to Step 111.

[0423] In Step 115, 1 is substituted for X2, 1 is for Y2 and TRUE is forF and the step goes forward to Step 111.

[0424] In Step 116, the value of X2 is judged, and in case of X2=0, thestep goes forward to Step 116, and otherwise the step-goes forward toStep 118.

[0425] In Step 117, Y1+1 is substituted for Y1 and 1 is for X2 and thestep goes forward to Step 111.

[0426] In Step 118, the values of X2 and X1 are brought into comparisonso that in case of X1=X2, the step goes forward to Step 119 andotherwise the step goes forward to Step 120.

[0427] In Step 119, Y1+1 is substituted for Y1, 1 is for X2 and 1 is forY2 so that the step goes forward to Step 111.

[0428] In Step 120, the value of X2 is judged, and in case of X2>1, thestep goes forward to Step 121, and otherwise the step goes forward toStep 123.

[0429] In Step 121, (X1, Y1) is added to the transmission packet modelist 1101 and in Step 122, X2 is substituted for X1 and Y2 is for Y1respectively, and thereafter 1 is substituted for X2 and 1 is for Y2respectively so that the step goes forward to Step 111.

[0430] In Step 123, (X1, Y1) is added to the transmission packet modelist 1101 and in Step 124, 1 is substituted for X1, 2 is for Y1, 0 isfor X2 and 0 is for Y2 respectively so that the step goes forward toStep 111.

[0431] In addition, in Step 125, judging the value of the flag F, thestep goes forward to Step 126 in case of F=FALSE while the step goesforward to Step 127 in case of F=TRUE.

[0432] In Step 126, (X1, Y1) is added to the transmission packet modelist 1101 and the step goes forward to Step 132.

[0433] Moreover, in Step 127, the values of X2 and X1 are brought intocomparison so that in case of X1=X2, the step goes forward to Step 128and otherwise the step goes forward to Step 130.

[0434] In Step 128, Y1+1 is substituted for Y1 and (X1, Y1) is added tothe transmission packet mode list 1101 in Step 129 so that the step goesforward to Step 132.

[0435] In Step 130, (X1, Y1) is added to the transmission packet modelist 1101 while (X2, Y2) is added to the transmission packet mode list1101 in Step 131 so that the step goes forward to Step 132.

[0436] In Step 132, (0, N−1) is added to the transmission packet modelist 1101 while 1 is substituted for X1, 1 is for Y1, 0 is for X2 and 0is for Y2 respectively in Step 133 so that the step goes forward to Step111.

[0437] Lastly, the processing comes to an end in Step 111.

[0438] Output results of the transmission packet mode list 1101 at thetime when the processing as described so far has been executed on thesource packet as in FIG. 9 will be expressed in FIG. 14. The CIP data302 will be constructed based on this transmission packet mode list 1101as in FIG. 10.

[0439] Incidentally, conditional alternatives as Step 103 do notnecessarily have to proceed in this order, but any one will do ifconditions to be fulfilled to reach each Step lastly are the same asthose in FIGS. 11 to 13.

[0440] In addition, apart of or the whole of each Step in FIGS. 11 to 13may be constructed of softwares.

Third Embodiment

[0441] Another example of operations of the time stamp sample judgingpart 705 in the first Embodiment of the present invention will bedescribed as a third embodiment of the present invention with referenceto FIGS. 15 to 17 as follows.

[0442]FIG. 15 is a flowchart describing operations of the time stampsample judging part 705. In FIG. 15, reference numeral 1301 denotes abuffer for final difference value and reference numeral 1302 does ashunting buffer.

[0443]FIGS. 16 and 17 exemplify output results of transmission packetmode list 1101.

[0444] In FIG. 15, the description “X1=1;” means that 1 is substitutedfor X1 as in FIGS. 11 to 13.

[0445] Operations of the time stamp sample judging part 705 will bedescribed as follows.

[0446] As an initial state, J=0 shall be adopted for substitution.

[0447] In addition, T units of source packets 103 shall besimultaneously transmitted to the time stamp sample judging part 705 aswell as the CIP producing part 703.

[0448] At first, upon receipt of T units of the source packets 103,processing starts in Step 201, and 1 is substituted for X1, 0 is for Y1,0 is for X2 and 0 is for Y2 respectively in Step 202.

[0449] In Step 203, a value of J is judged and in case of J>0, the stepgoes forward to Step 204 and otherwise the step goes forward to Step207.

[0450] In Step 204, a value of N0 is judged and in case of N0>1, thestep goes forward to Step 205 and otherwise the step goes forward toStep 206.

[0451] In Step 205, (0, N0−1) is added to the transmission packet modelist 1101 and J is substituted for X1 and 1 is for Y1 in Step 206respectively.

[0452] In Step 207, among T units of source packets 103 received in Step201, the last source packet and all the source packets that have thesame value as the Cycle_Count of the time stamp 201 of the last sourcepacket and are brought into connection in series with the last sourcepacket are stored in the shunting buffer 1302. For example, in FIG. 16,three units of the source packet 103 e, the source packet 103 f and thesource packet 103 g are stored in the shunting buffer 1302.

[0453] In Step 208, the number of units of source packets stored in theshunting buffer 1302 is stored into J, and at the same time, thedifference between the Cycle_Count value of the time stamp 201 of thelast source packet and the Cycle_Count value of the time stamp 201 ofthe last source packet that was not stored into the shunting buffer 1302is stored into the buffer for final difference 1301 as the finaldifference N0. In the example of FIG. 16, 3 being the difference betweenthe Cycle_Count value of the time stamp 201 of the source packet 103 dand the Cycle_Count value of the time stamp 201 of the source packet 103g is stored in the buffer for final difference 1301 as the finaldifference N0.

[0454] The source packet that was stored in the shunting buffer 1302will not be processed this time, but will be processed in Step 203 toStep 206 when T units of source packets are received next time. Forexample, the source packet 103 e, the source packet 103 f and the sourcepacket 103 g that were stored in FIG. 16 will be processed firstly priorto processing of the received source packet when the source packet isreceived next time as in FIG. 17.

[0455] In Step 209, processes in FIGS. 11 to 13 having been described inthe second Embodiment are subsequently executed on the received sourcepackets 103 so that in Step 210, it is judged whether or not processeson the (T-J) units of source packets 103 have been entirely finalized,and if all are finalized, the step goes forward to Step 210, andotherwise the step goes back to Step 209 so that processes on the nextsource packet proceed.

[0456] At the point of time when the step goes forward to Step 211,survey on all the T units of received source packets 103 or storagethereof into the shunting buffer 1302 will be finalized. Step 211 andonwards will be processing to add the remaining values in (X1, Y1) aswell as (X2, Y2) to the transmission packet mode list 1101.

[0457] In Step 211, the value of the flag F is judged and in case ofF=FALSE, the step goes forward to Step 212 while in case of F=TRUE, thestep goes forward to Step 213.

[0458] In Step 212, (X1, Y1) is added to the transmission packet modelist 1101, and the step goes forward to Step 218.

[0459] Moreover, in Step 213, the values of X1 and X2 are brought intocomparison so that in case of X1=X2, the step goes forward to Step 214and otherwise the step goes forward to Step 216.

[0460] In Step 214, Y1+1 is substituted for Y1 and (X1, Y1) is added tothe transmission packet mode list 1101 in Step 215 so that the step goesforward to Step 218.

[0461] In Step 216, (X1, Y1) is added to the transmission packet modelist 1101 while (X2, Y2) is added to the transmission packet mode list1101 in Step 217 so that the step goes forward to Step 218.

[0462] Lastly, the processing comes to an end in Step 218.

[0463] Output results of the transmission packet mode list 1101 at thetime when the processing as described so far has been executed will beexpressed in FIGS. 16 and 17.

[0464] Incidentally, T=7 is adopted in FIGS. 16 and 17, but T may adoptanother value, and moreover T may be a fixed value or may be a variablevalue.

[0465] In addition, a part of or the whole of each Step in FIG. 15 maybe constructed of softwares.

Fourth Embodiment

[0466] A fourth Embodiment of the present invention will be describedwith reference to FIGS. 18 to 21 as follows.

[0467]FIG. 18 is an example of a transmitting apparatus. In FIG. 18,reference numeral 1601 denotes a PC, reference numeral 1602 does a CIPproducing part, reference numeral 1603 does a split number designatingpart, reference numeral 1604 does a time stamp sample judging part andreference numeral 1605 does a split number.

[0468]FIG. 19 is an example of splitting method of the source packet 103a. In FIG. 19, reference numerals 1701 a 1 and 1701 a 2 denote splittingblocks.

[0469]FIG. 20 is an example of source packet data read out from a harddisk 706.

[0470]FIG. 21 is a construction of the CIP produced from the sourcepacket data in FIG. 20.

[0471] Incidentally, the PC 1601 of the present embodiment is an exampleof transmitting apparatus of the present invention.

[0472] Incidentally, at the time when MPEG2-TS data are transmitted, inthe case where a data rate is sufficiently low, the source packet 103can be split to construct the CIP data 304 so that the transmitting bandwidth of the IEEE1394 bus for use is made less. For example, in case ofFIG. 19, the source packet 103 a with 192 bytes are split into asplitting block 1701 a 1 and a splitting block 1701 a 2 respectivelywith 96 bytes. To this splitting block 1701 a 1, the CIP header 301 isadded to construct the CIP data 302 as in the case where splitting doesnot take place.

[0473] This split number can take any of 2, 4 or 8, and is split equallyby 96 bytes, 48 bytes and 24 bytes respectively. The split number willnot undergo any changes until transmission of series of data comes to anend.

[0474] Now, operations of the PC 1601 will be described.

[0475] At first in the hard disk 706, TS packet data are stored as inthe first Embodiment in a format as in FIG. 8.

[0476] At first, prior to data transmission, the split numberdesignating part 1603 takes a split number 1605 in advance and will haveoutputted, for example, M=2 to the CIP producing part 1602 and the timestamp sample judging part 1604. The designated split number 1605 shallnot under any changes until transmission is finalized.

[0477] The data reading part 704 reads out the source packet 103, thatis, a pair of a source packet header 102 and a TS packet 101 from thehard disk 706 so as to output to the CIP producing part 1602 and thetime stamp sample judging part 1604.

[0478] The time stamp sample judging part 1604 extracts the time stamp201 from the received source packet header 102, and takes the differenceN between the Cycle_Count value of that time stamp 201 and theCycle_Count value of that time stamp 201 having been included in thesource packet header 102 received immediately prior thereto. However, incase of the initially received source packet 103, N=1 shall be taken.

[0479] At this time, for variable values A being A≧0, under N≦(A+1), thereceived source packet 103 is split into M=2 units and the CIP producingpart 1602 is instructed to construct the CIP data 301.

[0480] Here, with Nc being the difference between the Cycle_Count valueof that time stamp 201 included in the initially received source packet103 and the Cycle_Count value of that time stamp 201 included in thesource packet 103 received at this time and with P units being thenumber of units of the CIP data 301 having been produced up to thenincluding the Empty packets, the value of A will be caused to change soas to get closer to Nc=P as much as possible. However, the Cycle_Countcan only take values of 0 to 7999, and is arranged to get back to 0 incase of exceeding 8000. Therefore, Nc is not simply the differencebetween values of the time stamp 201, but shall be the accumulated valueup to then.

[0481] In addition, in case of N>(A+1), after the CIP producing part1062 is instructed to insert (N−A−1) units of Empty packets, thereceived source packet 103 is split into M=2 units and the CIP producingpart 1602 is instructed to construct the CIP data 301.

[0482] As a deciding method on A, with A=0 being the initial value, eachtime upon receipt of a new source packet 103 the CIP producing part 1602is instructed, (A+M−N) shall be newly substituted for A in case ofN≦(A+1) while (M−1) shall be substituted for A in case of N>(A+1).

[0483] For example, in case of FIG. 20, at first, for the source packet103 a being the initial source packet, N=1 is given, and at this pointof time, due to A=0, N≦(A+1) is given, and therefore the source packet103 a is split into M=2 units and the CIP producing part 1602 isinstructed to construct the CIP data 301. At this point of time,A=0+2−1=1 will be given.

[0484] For the source packet 103 b, N=1 is given, and due to A=1,N≦(A+1) is given, and therefore the source packet 103 b is split intoM=2 units and the CIP producing part 1602 is instructed so as toconstruct the CIP data 301. At this point of time, A=1+2−2=1 will begiven.

[0485] The source packet 103 c will give rise to similar results, andalso A=1 will be given.

[0486] In addition, for the source packet 103 d, N=3 will be given, anddue to A=1, N>(A+1) will be given. Therefore, at first, after the CIPproducing part 1602 has been instructed to insert (3−1−1)=2 units ofEmpty packets, the CIP producing part 1602 is instructed to split thesource packet 103 d into M=2 units to produce the CIP data 301. In thiscase, A=2−1=1 will be given.

[0487] Well, the CIP producing part 1602 produces the CIP data 302 fromthe received source packet 103 according to the above described methodto output them to the IEEE1394 interface 702.

[0488] In addition, upon receipt of instruction to insert the Emptypacket, the CIP producing part 902 produces the CIP data 302 constructedonly of the CIP header 301 to output them to the IEEE1394 interface 702.

[0489] The IEEE1394 interface 702 adds an isochronous header 402, aheader CRC 403 and data CRC 404 to the received CIP data 302 as in FIG.4 so as to create isochronous packet 401 for an output to an IEEE1394bus 706.

[0490] The outputted isochronous packet 401 is received, for example, bythe receiving apparatus 708.

[0491] As described so far, splitting the TS packet data stored in thehard disk 706, the isochronous packet 401 is constructed and can beoutputted to the IEEE1394 bus 706.

[0492] Incidentally, in the present embodiment, 2 was taken for thevalue of M, but any value of M=1, 2, 4 and 8 will do. However, in caseof M=1, operations of the CIP producing part 1602 as well as the timestamp sample judging part 1604 shall operate as having been describedfor the first Embodiment.

[0493] In addition, the deciding method on A will not be limited tothose having been described above, but any values that might give riseto Nc=P as much as possible may be determined any way.

[0494] Incidentally, the source packet 103 has been taken as the onestored in the hard disk 706, but a pair of the TS packet 101 and thetime stamp 201 will do as well or another time information created fromthe time stamp 201 instead of the time stamp 201 will do as well. Inthis case, the time stamp 201 as well as the source packet header 102are produced in the data reading part 704.

[0495] In addition, the data file on the hard disk 704 may be stored inan AVI file format, an ASF file format, or a QuickTime file format, ormay not store additional information such as a header and a trailer.

[0496] In addition, the source packet header 102 and the TS packet 101may not be stored in order as in FIG. 8.

[0497] In addition, the data to be transmitted are not limited to aMPEG2 TS packet, but a source packet including a source packet headerwill do.

[0498] In addition, apart of or the whole transmitting apparatus maybeconstructed of softwares, or the transmitting apparatus may not be a PC.

Fifth Embodiment

[0499] An example of operations of the time stamp sample judging part1604 in the fourth Embodiment of the present invention will be describedas a fifth Embodiment of the present invention with reference to FIGS.22 to 23 as follows.

[0500]FIG. 22 is a flowchart describing operations of the time stampsample judging part 1604.

[0501]FIG. 23 exemplifies output results of the transmission packet modelist 1101.

[0502] In FIG. 22, the description “X1=1;” means that 1 is substitutedfor X1 as in FIGS. 11 to 13.

[0503] Operations of the time stamp sample judging part 1604 will bedescribed as follows.

[0504] As an initial state, A=0 and Y1=1 shall be adopted forsubstitution.

[0505] At first, upon receipt of the source packet 103, processingstarts in Step 301, a time stamp of the source packet receivedimmediately prior thereto in Step 302 and the time stamp of the sourcepacket received this time are extracted so that the difference N betweentheir respective Cycle_Count values is acquired. In case of theinitially received source packet, N=1 shall be taken.

[0506] Next, in Step 303, the value of N is judged, and for N>(A+1), thestep goes forward to Step 306, and otherwise the step goes forward toStep 304.

[0507] In Step 304, (Y1+1) is substituted for Y1 and in Step 305,(A+M−N) is for A, and the step goes forward to Step 310.

[0508] Moreover in Step 306, the value of Y1 is judged, and in case ofY1>0, the step goes forward to Step 307, and otherwise the step goesforward to Step 308.

[0509] In Step 307, (1, Y1) is added to the transmission packet modelist 1101 and the step goes forward to Step 308.

[0510] In Step 308, (0, N−A−1) is added to the transmission packet modelist 1101 so that 1 is substituted for Y1 and (M+1) is for A in Step 309respectively and the step goes forward to Step 310.

[0511] Lastly, the processing comes to an end in Step 310.

[0512] Output results of the transmission packet mode list 1101 at thetime when the processing as described so far has been executed on thesource packet as in FIG. 20 will be expressed in FIG. 23. At this time,in case of X=1, the source packet 103 shall be split into M units ofsplitting blocks to produce the CIP data 302.

[0513] The CIP data 302 will be constructed based on this transmissionpacket mode list 1101 as in FIG. 21.

[0514] Thus, according to the present embodiment, based on the timestamp included in the source packet, the CIP data are produced so thatthe TS packet will become easily transmittable from a PC onto theIEEE1394.

[0515] In addition, a part of or the whole of each Step in FIG. 15 maybe constructed of softwares.

Sixth Embodiment

[0516] A sixth Embodiment of the present invention will be describedwith reference to FIGS. 24 and 25 as follows.

[0517]FIG. 24 is an example of a source packet generating apparatus.

[0518] In FIG. 24, reference numeral 2401 denotes a time stamp addingpart, reference numeral 2402 does a TS packet generating part, referencenumeral 2403 does a data reading part, reference numeral 204 does atransmitting part, reference numeral 2405 does a hard disk, referencenumeral 2406 does a PC, reference numeral 2407 does time information,and reference numeral 2408 does a PS (Program Stream) packet.

[0519]FIG. 25 is an example of a method for generating the time stamp201.

[0520] At first, the data reading part 2403 reads out the PS packet 2408from the hard disk 2405 so as to output it to the TS packet generatingpart 2402.

[0521] The TS packet generating part 2402 generates the TS packet 101corresponding with the MPEG2 standards from the received PS packet 2408so as to output it to the time stamp adding part 2401. At this time,transmission timing of the TS packet 101 is determined by the TS packetgenerating part 2402, the time information 2407 on the time axisexpressed by the operation clock (27 MHz) of the MPEG2 is outputtedtogether.

[0522] Transmission timing of the TS packet 101 will become, forexample, the time axis of 27 MHz in FIG. 25.

[0523] The time stamp adding part 2401 converts the received timeinformation 2407 into time information on the time axis expressed by theoperation clock (24.576 MHz) of the IEEE1394. Conversion of timeinformation is executed, for example, as follows.

[0524] At first, time on the time axis in the operation clock of theIEEE1394 of the head TS packet 101 a of the stream will be 0 as theinitial value.

[0525] Next, time difference between a certain TS packet and the head TSpacket 101 a is converted into operation clock of IEEE1394. For example,as in FIG. 25, suppose that the time difference between the TS packet101 a and the TS packet 101 b is 5000 cycles at 27 MHz being theoperation clock of MPEG2, this is converted into 24.576 MHz being theoperation clock of IEEE1394, approximately 4551 cycles will be given.Describing this as value of the CTR shown in FIG. 6, 0×000015C7 will begiven, and 25 bits lower than this value will become the value of thetime stamp to be added to the TS packet 101 b.

[0526] The time stamp adding part 2401 outputs the one with the timestamp 201 produced as described so far having been added to the TSpacket 101 to the transmitting part 2404 as the source packet 103.

[0527] The transmitting part 2404 executes operations similar to the CIPproducing part 703, the IEEE1394 interface 702 and the time stamp samplejudging part 705, for example, in the first Embodiment of the presentinvention so as to output the isochronous packet 401 to the IEEE1394 bus707. The outputted isochronous packet 401 is transmitted to thereceiving apparatus 708 and the like via the IEEE1394 bus 707.

[0528] As described so far, from the TS packet 103 as well as the timeinformation 2407 generated from the PS packet data stored in the harddisk 2405, the time stamp 201 is generated and added so that the sourcepacket 103 is generated and the isochronous packet 401 is constructedfrom the source packet 103 and can be outputted to the IEEE1394 bus 706.

[0529] Incidentally, the time stamp adding part 2401 is to generate thetime stamp 201 by converting the time difference between a certain TSpacket and the head TS packet 101 a into operation clock of IEEE1394,but the time stamp to be added to a certain TS packet may be produced bya different method such as generating by adding values expressing thetime difference between the immediately prior TS packet and that TSpacket with operation clock of IEEE1394 to the value of the time stampadded to the immediately prior TS packet. In short, the only thing to dois to enable the time information expressed by the operation clock ofMPEG2 to be expressed on the time axis of the operation clock ofIEEE1394.

[0530] In addition, the time stamp adding part 2401 of the presentembodiment has been described to generate the time stamp 201 byconverting the time difference between a certain TS packet and the headTS packet 101 a into the operation clock of IEEE1394, but will not belimited thereto. The time stamp 201 may be generated by converting thetime difference with TS packet 101 a other than the head into theoperation clock of IEEE1394. In short, only thing to do is to generatethe time stamp 201 by converting the time difference with apredetermined TS packet into the operation clock of IEEE1394.

[0531] In addition, the TS packet generating part 2402 is to convert thePS packet 2408 stored on the hard disk 2405 via the data reading part2403 to the TS packet 101, but the PS packet 2408 may be stored not onthe hard disk 2405 but in another recording apparatus, or may beoutputted from LAN or the Internet and the like.

[0532] In addition, the TS packet generating part 2402 is to convert thePS packet 2408 into the TS packet 101, but may generate the TS packet101 from other data, or receive inputs of the TS packet 101 from outsideto generate that time information 2407 and may output it to the timestamp adding part 2401 together with the TS packet 101.

[0533] In addition, it may be arranged that the TS packet generatingpart 2402 adds a dummy time stamp with the same sizes as the time stamp201 to the TS packet 101 instead of the TS packet 101 and the time stampadding part 2401 is replaced with the time stamp 201 that has generatedthis dummy time stamp.

[0534] In addition, instead of outputs to the IEEE1394 bus 707 via thetransmitting part 2404, the source packet 103 generated in the timestamp adding part 2401 maybe stored in the recording apparatus such as ahard disk etc. or be outputted to a LAN or the Internet etc.

[0535] In addition, instead of the TS packet 101, packet data other thanthe MPEG2 transport stream may be outputted. In short, anything will doif it is packet data based on an operation clock format different fromthat of IEEE1394, that require time information based on the CTR ofIEEE1394 to be added at the time of transmission.

[0536] In addition, a part of or the whole source packet generatingapparatus may be constructed of softwares, or the source packetgenerating apparatus may not be a PC.

Seventh Embodiment

[0537] A seventh Embodiment of the present invention will be describedwith reference to FIG. 26 as follows.

[0538]FIG. 26 is an example of a source packet generating apparatus. InFIG. 26, reference numeral 2601 denotes a buffer.

[0539] Operations of the data reading part 2403, the TS packetgenerating part 2402 and the time stamp adding part 2401 are similar tothose in the sixth Embodiment of the present invention.

[0540] The time stamp adding part 2401 stores the one with the TS packet101 to which the generated time stamp 201 has been added as the sourcepacket 103 in the buffer 2601.

[0541] When the number of the stored source packets 103 reaches aconstant amount, for example, 256 packets, the buffer 2601 outputs thesesource packets 103 to the transmitting part 2602 collectively.

[0542] The transmitting part 2602 outputs the isochronous packet 401 tothe IEEE1394 bus 707 by executing operations similar to those of the CIPproducing part 703, the IEEE1394 interface 702 and the time stamp samplejudging part 705 in the first or third Embodiment. The outputtedisochronous packet 401 is transmitted to the receiving apparatus 708 andthe like via the IEEE1394 bus 707.

[0543] As described so far, from the TS packet 103 as well as the timeinformation 2407 generated from the PS packet data stored in the harddisk 2405, the time stamp 201 is generated and added so that the sourcepacket 103 is generated and the isochronous packet 401 is constructedfrom the source packet 103 and can be outputted to the IEEE1394 bus 706.

[0544] Incidentally, the time stamp adding part 2401 of the presentembodiment is an example of time information adding means of the presentinvention.

[0545] Incidentally, the time stamp adding part 2401 is to generate thetime stamp 201 by converting the time difference between a certain TSpacket and the head TS packet 101 a into operation clock of IEEE1394,but the time stamp to be added to a certain TS packet may be produced bya different method such as generating by adding values expressing thetime difference between the immediately prior TS packet and that TSpacket with operation clock of IEEE1394 to the value of the time stampadded to the immediately prior TS packet. In short, the only thing to dois to enable the time information expressed by the operation clock ofMPEG2 to be expressed on the time axis of the operation clock ofIEEE1394.

[0546] In addition, the TS packet generating part 2402 is to convert thePS packet 2408 stored on the hard disk 2405 via the data reading part2403 to the TS packet 101, but the PS packet 2408 may be stored not onthe hard disk 2405 but in another recording apparatus, or may beoutputted from LAN or the Internet and the like.

[0547] In addition, the TS packet generating part 2402 is to convert thePS packet 2408 into the TS packet 101, but may generate the TS packet101 from other data, or receive inputs of the TS packet 101 from outsideto generate that time information 2407 and may output it to the timestamp adding part 2401 together with the TS packet 101.

[0548] In addition, it may be arranged that the TS packet generatingpart 2402 adds a dummy time stamp with the same sizes as the time stamp201 to the TS packet 101 instead of the TS packet 101 and the time stampadding part 2401 is replaced with the time stamp 201 that has generatedthis dummy time stamp.

[0549] In addition, instead of outputs to the IEEE1394 bus 707 via thetransmitting part 2404, the buffer 2601 may store the stored sourcepacket 103 in the recording apparatus such as a hard disk etc. or mayoutput it to a LAN or the Internet etc.

[0550] In addition, instead of the TS packet 101, packet data other thanthe MPEG2 transport stream may be outputted. In short, anything will doif it is packet data based on an operation clock format different fromthat of IEEE1394, that require time information based on the CTR ofIEEE1394 to be added at the time of transmission.

[0551] In addition, a part of or the whole source packet generatingapparatus may be constructed of softwares, or the source packetgenerating apparatus may not be a PC.

[0552] Incidentally, the present invention is a program for executing afunction of the whole of or a part of means (or apparatus, element,circuit or part etc.) of the transmitting apparatus or the source packetgenerating apparatus of the present invention described above with acomputer and is a program to operate in collaboration with the computer.

[0553] Moreover, the present invention is a program for executingoperations of the whole of or a part of steps (or processes, operationsor functions etc.) of the packet mode determining method of the presentinvention described above with a computer and is a program to operate incollaboration with the computer,

[0554] Moreover, the present invention is a medium bearing a program forexecuting all or a part of operations of the whole of or a part of stepsof the packet mode determining method of the present invention describedabove with a computer, which is computer-readable, and in which theabove described program read by the computer executes the abovedescribed operations in collaboration with the above described computer.

[0555] Moreover, the present invention is a medium bearing a program forexecuting all or a part of functions of all or a part of means of thetransmitting apparatus or the source packet generating apparatus of thepresent invention described above with a computer, which iscomputer-readable, and in which the above described program read by thecomputer executes the above described functions in collaboration withthe above described computer.

[0556] Incidentally, a part of means (or apparatus, elements, circuits,parts etc.) of the present invention and a part of steps (or processes,operations, functions etc.) of the present invention refer to severalmeans or steps of the plurality of means or steps thereof or refer to apart of functions or a part of operations of one of means or step.

[0557] In addition, a computer-readable recording medium which stores aprogram of the present invention is also included in the presentinvention.

[0558] In addition, one mode of use of the program of the presentinvention may have an aspect in which the program is stored in therecording medium that can be read out by the computer, and operates incollaboration with the computer.

[0559] In addition, one mode of use of the program of the presentinvention may have an aspect in which the program is transmitted in atransmission medium, is read by the computer, and operates incollaboration with the computer.

[0560] In addition, the data structure of the present invention includesa database, a data format, a data table, a data list and kinds of dataetc.

[0561] In addition, the recording medium includes a ROM etc., and thetransmission medium includes transmission media such as the Internetetc., lights, electric waves and sound waves etc.

[0562] In addition, the computer of the present invention describedabove will not be limited to pure hardwares such as CPUs etc. but mayinclude firmwares, OSs, and moreover peripheral equipment.

[0563] Incidentally, as having been described above, the construction ofthe present invention may be realized softwarewise or may be realizedhardwarewise.

[0564] As apparent from what has been described so far, the presentinvention can provide transmitting apparatuses, transmitting method,packet mode determining methods, media and programs that can easilydetermine how the TS packet data are transmitted based on the values ofthe time stamp in the case where the TS packet data are read out fromthe recording apparatus such as the hard disk etc. and are transmittedwith IEEE1394.

[0565] In addition, as apparent from what has been described so far, thepresent invention can provide source packet generating apparatus, sourcepacket generating method, media and programs that can easily generatethe value of the time stamp to be added to the TS packet data.

What is claimed is:
 1. A transmitting apparatus for transmitting asource packet constructed of a pair of data of a source packet data anda source packet header including a time stamp, comprising: transmissionpacket generating means of investigating values of a predeterminedportion of said time stamp included in said source packet when saidsource packet is inputted, unifying said source packets that have a samevalue for said predetermined portion and are inputted in series tooutput as one unit of transmission packet data; and data outputtingmeans of producing a transmission packet by adding predeterminedadditional information to said outputted transmission packet data andoutputting said produced transmission packet outward.
 2. Thetransmitting apparatus according to claim 1, wherein said transmissionpacket generating means outputs (N−1) units of dummy transmission packetdata to said data outputting means, in the case where difference betweenvalues of said predetermined portions of said time stamps included intwo source packets inputted in series is N being N≧2.
 3. A transmittingapparatus for transmitting a source packet constructed of a pair of dataof the source packet data and a source packet header including a timestamp, comprising: split number designating means of designating a splitnumber M (M≧1) to split said source packet; transmission packetgenerating means of investigating values of a predetermined portion ofsaid time stamp included in said source packet when said source packetis inputted, outputting said M units split from said source packet astransmission packet data when difference between values of predeterminedportions of said time stamp included in said two source packets inseries is N(N≧0) being N≦L(L≧1), and outputting (N−L) units of dummytransmission packet data when difference between values of saidpredetermined portions of said time stamp is N being N>L; and dataoutputting means of outputting as transmission packet outward thosebeing said outputted transmission packet data and/or said dummytransmission packet data to which a predetermined additional informationis added.
 4. The transmitting apparatus according to claim 3, whereinsaid M is 2, 4 or
 8. 5. The transmitting apparatus according to any ofclaims 1 to 4, wherein K units of said source packets having variablelength or fixed length with K≧1 are inputted as a group to saidtransmission packet generating means.
 6. The transmitting apparatusaccording to any of claims 1 to 5, wherein said predetermined additionalinformation is a CIP header, an isochronous header, a header CRC and adata CRC, said data outputting means has: a CIP header adding means ofadding said predetermined CIP header to said outputted transmissionpacket data; and an IEEE1394 interface for producing said transmissionpacket by further adding said isochronous header, said header CRC andsaid data CRC to the transmission packet data to which saidpredetermined CIP header is added and outputting said producedtransmission packet outward.
 7. The transmitting apparatus according toclaim 6, wherein data of said source packet are a transport streampacket of MPEG.
 8. The transmitting apparatus according to claim 7,wherein said time stamp is expressed with Cycle_Count and Cycle_Offsetof CycleTimeRegister of IEEE1394 standards, and said predeterminedportion is a portion of said Cycle_Count.
 9. A packet mode determiningmethod, wherein upon receipt of a source packet constructed of a pair ofdata of the source packet data and a source packet header including atime stamp, FALSE is substituted for a flag F expressed by TRUE orFALSE, and at the same time, difference N between a value of said timestamp included in said source packet received immediately prior theretoand a value of the time stamp included in said source packet receivedthis time is calculated; in the case where N=0 is given, and the flag Fexpressed by TRUE or FALSE gives F=TRUE, and a first buffer expressed bya pair of two units of numeric values being (X1, Y1) fulfills X1=1 andY1>1, after Y1 is replaced with (Y1−1), (X1, Y1) being contents of saidfirst buffer is added to a packet mode list, and moreover X1=2, Y1=1 aresubstituted for said first buffer; in the case where N=0 is given, andsaid flag F is F=TRUE, and the first buffer expressed by a pair of twounits of numeric values being (X1, Y1) is X1≠1 and/or Y1≦1, X1 isreplaced with (X1+1); in the case where N=0 is given, and said flag F isF=TRUE, X1 of the first buffer expressed by a pair of two units ofnumeric values being (X1, Y1) is replaced with (X1+1) in the case whereN=1, and said flag F is F=FALSE and X2≦1, 1 is substituted for X1 and Y1is replaced with (Y1+1); in the case where N=1, and said flag F isF=FALSE and X2>1, said flag F is made to constitute F=TRUE and, at thesame time, 1 is substituted for X2 and Y2 is replaced with 1; in thecase where N=1, and said flag F is F=TRUE and X2=0, Y1 is replaced with(Y1+1) and, at the same time, 1 is substituted for X2; in the case whereN=1, and said flag F is F=TRUE and X2>0 and X1=X2, Y1 is replaced with(Y1+1) and, at the same time, 1 is substituted for X2 and 1 issubstituted for Y2; in the case where N=1, and said flag F gives F=TRUE,X2>0, X1≠X2, and X2>1, after adding (X1, Y1) being contents of saidfirst buffer to said packet mode list, X2 is substituted for X1 and Y2is substituted for Y1 and thereafter 1 is substituted for X2 and 1 issubstituted for Y2; in the case where N=1 is given, and said flag Fgives F=TRUE, X2>0, X1≠X2, and X2≦1, after adding (X1, Y1) beingcontents of said first buffer to said packet mode list, 0 is substitutedfor X2 and 0 is substituted for Y2 and thereafter 1 is substituted forX1, 2 is substituted for Y1 and FALSE is substituted for F; in the casewhere N≧2 is given, and said flag F gives F=FALSE, (X1, Y1) beingcontents of said first buffer to said packet mode list, and in the casewhere N≧2 is given, and said flag F gives F=TRUE and X1=X2 is given, Y1is replaced with (Y+1) and thereafter (X1, Y1) being contents of saidfirst buffer is added to said packet mode list; in the case where N≧2 isgiven, and said flag F gives F=TRUE and X1≠X2 is given, (X1, Y1) beingcontents of said first buffer is added to said packet mode list, andmoreover (X2, Y2) being contents of said second buffer is added to saidpacket mode list; in the case where N≧2 is given, (0, N−1) is added tosaid packet mode list and 1.1, 0, 0, and False are substituted for X1,Y1, X2, Y2 and F, respectively; lastly for each item (K, L) of saidpacket mode list, in case of K≧1, K units of said source packets areconstructed as one unit of transmission packet data and L units of saidtransmission packet data including K units of said source packets arearranged in series; and in case of K=0, with dummy data being saidtransmission packet, L units of said dummy data are arranged in series.10. The packet mode determining method according to claim 9, whereinN=1, X1=1, and Y1=0 in case of initially received said source packet.11. A packet mode determining method; wherein upon receipt of a sourcepacket of T units for one pair (T≧1) constructed of a pair of data ofthe source packet data and a source packet header including a timestamp, in the case where J units (J≧1) of said source packets are insafekeeping in a shunting buffer, a pair of (0, N0−1) is added to apacket mode list only when the kept difference number N0 is N0>1, andthereafter for a first buffer expressed by a pair of two units ofnumeric values being (X1, Y1), J is substituted for X1 and 1 issubstituted for Y1; among M units of said source packets, all saidsource packets that have the same value as that in a predeterminedportion of said time stamp of said source packet located in the last andthat are brought into series with said source packet located in the lastare stored into said shunting buffer; the number of units of said sourcepackets stored in said shunting buffer is substituted for J; differencebetween said time stamp of said source packet of the last among saidsource packet that are not stored in said shunting buffer and said timestamp of said source packets that is stored in said shunting buffer issubstituted for said kept difference number N0; FALSE is substituted fora flag F expressed by TRUE or FALSE and M units of said source packetsare checked sequentially from the head; difference N between a value ofsaid time stamp included in said source packet checked immediately priorthereto and a value of said time stamp included in said source packetchecked this time is calculated; in the case where N=0 is given, and theflag F expressed by TRUE or FALSE gives F=TRUE, and a first bufferexpressed by a pair of two units of numeric values being (X1, Y1)fulfills X1=1 and Y1>1, after Y1 is replaced with (Y1−1), (X1, Y1) beingcontents of said first buffer is added to a packet mode list, andmoreover X1=2, Y1=1 are substituted for said first buffer; in the casewhere N=0 is given, and said flag F is F=TRUE, and the first bufferexpressed by a pair of two units of numeric values being (X1, Y1) isX1≠1 and/or Y1≦1, X1 is replaced with (X1+1); in the case where N=0 isgiven, and said flag F is F=TRUE, X1 of the first buffer expressed by apair of two units of numeric values of (X1, Y1) is replaced with (X1+1);in the case where N=1, and said flag F is F=FALSE and X2≦1, 1 issubstituted for X1 and Y1 is replaced with (Y1+1); in the case whereN=1, and said flag F is F=FALSE and X2>1, said flag F is made toconstitute F=TRUE and, at the same time, 1 is substituted for X2 and Y2is replaced with 1; in the case where N=1, and said flag F is F=TRUE andX2=0, Y1 is replaced with (Y1+1) and, at the same time, 1 is substitutedfor X2; in the case where N=1, and said flag F is F=TRUE and X2>0 andX1=X2, Y1 is replaced with (Y1+1) and, at the same time, 1 issubstituted for X2 and 1 is substituted for Y2; in the case where N=1,and said flag F gives F=TRUE, X2>0, X1≠X2, and X2>1, after adding (X1,Y1) being contents of said first buffer to said packet mode list, X2 issubstituted for X1 and Y2 is substituted for Y1 and thereafter 1 issubstituted for X2 and 1 is substituted for Y2; in the case where N=1 isgiven, and said flag F gives F=TRUE, X2>0, X1≠X2, and X2≦1, after adding(X1, Y1) being contents of said first buffer to said packet mode list, 0is substituted for X2 and 0 is substituted for Y2 and thereafter 1 issubstituted for X1, 2 is substituted for Y1 and FALSE is substituted forF; in the case where N≧2 is given, and said flag F gives F=FALSE, (X1,Y1) being contents of said first buffer to said packet mode list, (X1,Y1) being contents of said first buffer is added to said packet modelist; in the case where N≧2 is given, and said flag F gives F=TRUE andX1=X2 is given, Y1 is replaced with (Y+1) and thereafter; (X1, Y1) beingcontents of said first buffer is added to said packet mode list; in thecase where N≧2 is given, and said flag F gives F=TRUE and X1≠X2 isgiven, (X1, Y1) being contents of said first buffer is added to saidpacket mode list, and thereafter moreover (X2, Y2) being contents ofsaid second buffer is added to said packet mode list; in the case whereN≧2 is given, after adding (0, N−1) to said packet mode list, 1, 1, 0, 0and FALSE are substituted for X1, Y1, X2, Y2 and F, respectively; andafter checking on all (T-J) units of said source packets comes to anend, in the case where said flag F is F=FALSE, (X1, Y1) being contentsof said first buffer is added to said packet mode list; in the casewhere said flag F gives F=TRUE and X1=X2, after Y1 is replaced with(Y+1), (X1, Y1) being contents of said first buffer is added to saidpacket mode list; in the case where said flag F gives F=TRUE and X1≠X2,(X1, Y1) being contents of said first buffer is added to said packetmode list; and moreover (X2, Y2) being contents of said second buffer isadded to said packet mode list; lastly for each item (K, L) of saidpacket mode list, in case of K≧1, K units of said source packets areconstructed as one unit of transmission packet data and L units of saidtransmission packet data including K units of said source packets arearranged in series; and in case of K=0, with dummy data being saidtransmission packet, L units of said dummy data are arranged in series.12. The packet mode determining method according to claim 11 wherein N=1and J=0 are given in case of initially received said source packet, andX1=0 and Y1=0 are given in case of said source packet located in thehead amount T units of said source packets.
 13. A packet modedetermining method, wherein upon receipt of a source packet constructedof a pair of data of the source packet data and a source packet headerincluding a time stamp, difference N between a value of said time stampincluded in said source packet received immediately prior thereto and avalue of the time stamp included in said source packet received thistime is calculated; in the case where said N gives N>(A+1), (N−A−1)units of dummy packets are outputted, and thereafter said source packetreceived this time is split into M units and outputted, and at the sametime (M−1) is substituted for A; and in the case where said N does notgive N>(A+1), said source packet received this time is split into Munits and outputted, and at the same time (M−N) is substituted for A.14. The packet mode determining method according to claim 13, whereinN=1 and A=0 in case of initially received said source packet.
 15. Thepacket mode determining method according to claim 13, wherein said M isa value designated in advance.
 16. The packet mode determining methodaccording to claim 14, wherein said M is a value designated in advance.17. The packet mode determining method according to claim 13, whereinsaid M is received in a pair with said source packet.
 18. The packetmode determining method according to claim 14, that said M is receivedin a pair with said source packet.
 19. The packet mode determiningmethod according to any of claims 13 to 18, wherein said M is 2, 4 or 8.20. The packet mode determining method according to any of claims 9 to18, wherein data of said source packet are an MPEG transport streampacket.
 21. The packet mode determining method according to claim 20,wherein said time stamp is expressed by Cycle_Count and Cycle_Offset ofCycleTimeRegister of IEEE1394 standards; and said difference N isdifference between said Cycle_Counts.
 22. A source packet generatingapparatus, comprising: packet generating means of generating a datapacket transmitted in a first clock and determining transmission timingof said data packet expressed in said first clock; and time informationadding means of converting said transmission timing to time informationon a time axis expressed in a second clock, adding to said data packetthe time stamp with a value determined based on all or a part of saidtime information and outputting a data packet to which the time stamp isadded as a source packet; wherein outputted said source packet isconverted into a packet for transmission based on the value of thatadded time stamp is outputted from an interface.
 23. The source packetgenerating apparatus according to claim 22, wherein in the case where apredetermined data packet in said data packet is given as a first datapacket and the data packet other than said first data packet in saiddata packet is given as a second data packet, said time informationadding means determines a value of time stamp to be added to said seconddata packet based on a value subject to conversion into time differencein said second clock from difference in said transmission timing in saidfirst clock between said first data packet and said second data packet.24. The source packet generating apparatus according to claim 23,wherein said time information adding means gives a value of time stampto be added to said first data packet being 0, and gives a value of timestamp to be added to said second data packet being a value subject toconversion into time difference in said second clock.
 25. The sourcepacket generating apparatus according to claim 23, wherein said timeinformation adding means gives a value of time stamp to be added to saidfirst data packet being a predetermined value, and gives a value of timestamp to be added to said second data packet being a value subject toaddition of said predetermined value subject to conversion into timedifference in said second clock.
 26. The source packet generatingapparatus according to claim 23, wherein said predetermined data packetis a head data packet.
 27. The source packet generating apparatusaccording to claim 22, wherein in the case where a data packet adjacentto a third data packet being a data packet with an already determinedvalue of time stamp is given as a fourth data packet, said timeinformation adding means gives a value subject to addition of a value ofsaid time stamp added to said third data packet to a value subject toconversion into time difference in said second clock from difference insaid transmission timing in said first clock between said third datapacket and said fourth data packet being a value of said time stamp tobe added to fourth data packet.
 28. The source packet generatingapparatus according to claim 27, wherein said time information addingmeans gives a value of time stamp to be added to a head data packet insaid data packet being a predetermined value.
 29. The source packetgenerating apparatus according to any of claims 22 to 28, wherein afrequency of said first clock is 27 MHz, and said data packet is anMPEG2 transport stream packet.
 30. The source packet generatingapparatus according to claim 29, wherein said packet generating meansoutputs said MPEG2 transport stream packet subject to addition of adummy time stamp instead of outputting said MPEG2 transport streampacket to said time information adding means, and said time informationadding means replaces said dummy time stamp with the generated said timestamp.
 31. The source packet generating apparatus according to claim 29,wherein said packet generating means receives an MPEG2 program streampacket and generates said MPEG2 transport stream packet from said MPEG2program stream packet.
 32. The source packet generating apparatusaccording to claim 30, wherein said packet generating means receives anMPEG2 program stream packet and generates said MPEG2 transport streampacket from said MPEG2 program stream packet.
 33. The source packetgenerating apparatus according to claim 29, wherein a frequency of saidsecond clock is approximately 24.576 MHz, said time information is avalue based on CycleTimeRegister in IEEE1394 standards; and said timestamp is a time stamp described in a source packet header in IEC61883.34. The source packet generating apparatus according to claim 22,wherein said “output” means “output outward”.
 35. The source packetgenerating apparatus according to claim 22, comprising buffer means ofstoring a data packet to which said time stamp is added as a sourcepacket, wherein said “output” means “write in said buffer”, and when apredetermined number of units of said source packets are written in,said buffer means outputs said predetermined number of units of saidsource packets.
 36. A program to cause a computer to function as a wholeor a part of: transmission packet generating means of investigatingvalues of a predetermined portion of said time stamp included in saidsource packet when said source packet is inputted, unifying said sourcepackets that have the same value for said predetermined portion and areinputted in series to output as one unit of transmission packet data,and data outputting means of producing transmission packet by addingpredetermined additional information to said outputted transmissionpacket data and outputting said produced transmission packet outward, ofthe transmitting apparatus according to claim
 1. 37. A program to causea computer to function as a whole or a part of: split number designatingmeans of designating a split number M (M≧1) to split said source packet;said transmission packet generating means of investigating values of apredetermined portion of said time stamp included in said source packetwhen said source packet is inputted, outputting said M units split fromsaid source packet as transmission packet data when difference betweenvalues of said predetermined portions of said time stamp included in twosource packets in series is N(N≧0) being N≦L(L≧1), and outputting (N−L)units of dummy transmission packet data when difference between valuesof said predetermined portions of said time stamp is N being N>L; anddata outputting means of outputting as transmission packet outward thosebeing said outputted transmission packet data and/or said dummytransmission packet data to which a predetermined additional informationis added; of the transmitting apparatus according to claim
 3. 38. Aprogram to cause a computer to function as a whole or a part of: packetgenerating means of generating a data packet transmitted in a firstclock and determining transmission timing of said data packet expressedin said first clock; and time information adding means of convertingsaid transmission timing to time information on a time axis expressed ina second clock, adding to said data packet the time stamp with a valuedetermined based on all or a part of said time information andoutputting a data packet to which the time stamp is added as a sourcepacket; of the source packet generating apparatus according to claim 22.39. A medium, that can be processed by a computer, and that bears aprogram to cause the computer to function as a whole or a part oftransmission packet generating means of investigating values of apredetermined portion of said time stamp included in said source packetwhen said source packet is inputted, unifying said source packets thathave the same value for said predetermined portion and are inputted inseries to output as one unit of transmission packet data, and dataoutputting means of producing transmission packet by addingpredetermined additional information to said outputted transmissionpacket data and outputting said produced transmission packet outward, ofthe transmitting apparatus according to claim
 1. 40. A medium capable ofbeing processed by a computer that bears a program to cause the computerto function as a whole or a part of split number designating means ofdesignate a split number M (M≧1) to split said source packet; saidtransmission packet generating means of investigating values of apredetermined portion of said time stamp included in said source packetwhen said source packet is inputted, outputting said M units split fromsaid source packet as transmission packet data when difference betweenvalues of said predetermined portions of said time stamp included in twosource packets in series is N(N≧0) being N≦L(L≧1), and outputting (N−L)units of dummy transmission packet data when difference between valuesof said predetermined portions of said time stamp is N being N>L; anddata outputting means of outputting as transmission packet outward thosebeing said outputted transmission packet data and/or said dummytransmission packet data to which a predetermined additional informationis added, of the transmitting apparatus according to claim
 3. 41. Amedium capable of being processed by a computer that bears a program tocause the computer to function as a whole or a part of packet generatingmeans of generating a data packet transmitted in a first clock anddetermining transmission timing of said data packet expressed in saidfirst clock; and time information adding means of converting saidtransmission timing to time information on a time axis expressed in asecond clock, adding to said data packet the time stamp with a valuedetermined based on all or a part of said time information andoutputting a data packet to which the time stamp is added as a sourcepacket; of the source packet generating apparatus according to claim 22.42. A program to cause a computer to execute all or a part of the steps,in the packet mode determining method according to claim 9 of: uponreceipt of a source packet constructed of a pair of data of the sourcepacket data and a source packet header including a time stamp,substituting FALSE for a flag F expressed by TRUE or FALSE, and at thesame time, calculating difference N between a value of said time stampincluded in said source packet received immediately prior thereto and avalue of the time stamp included in said source packet received thistime; in the case where N=0 is given, and the flag F expressed by TRUEor FALSE gives F=TRUE, and a first buffer expressed by a pair of twounits of numeric values being (X1, Y1) fulfills X1=1 and Y1>1, after Y1is replaced with (Y1−1), adding (X1, Y1) being contents of said firstbuffer to a packet mode list, and moreover substituting X1=2, Y1=1 forsaid first buffer; in the case where N=0 is given, and said flag F isF=TRUE, and the first buffer expressed by a pair of two units of numericvalues of (X1, Y1) is X1≠1 and/or Y1≦1, replacing X1 with (X1+1); in thecase where N=0 is given, and said flag F is F=TRUE, replacing X1 of thefirst buffer expressed by a pair of two units of numeric values (X1, Y1)with (X1+1); in the case where N=1, and said flag F is F=FALSE and X2≦1,substituting 1 for X1 and replacing Y1 with (Y1+1); in the case whereN=1, and said flag F is F=FALSE and X2>1, making said flag F constituteF=TRUE and, at the same time, substituting 1 for X2 and 1 for Y2; in thecase where N=1, and said flag F is F=TRUE and X2=0, replacing Y1 with(Y1+1) and, at the same time, substituting 1 for X2; in the case whereN=1, and said flag F is F=TRUE and X2>0 and X1=X2, replacing Y1 with(Y1+1) and, at the same time, substituting 1 for X2 and 1 for Y2respectively; in the case where N=1, and said flag F gives F=TRUE, X2>0,X1≠X2, and X2>1, after adding (X1, Y1) being contents of said firstbuffer to said packet mode list, substituting X2 for X1 and Y2 for Y1respectively and thereafter substituting 1 for X2 and 1 for Y2; in thecase where N−1 is given, and said flag F gives F=TRUE, X2>0, X1≠X2, andX2≦1, after adding (X1, Y1) being contents of said first buffer to saidpacket mode list, substituting 0 for X2 and 0 for Y2 and thereaftersubstituting 1 for X1, 2 for Y1 and FALSE for F; in the case where N>2is given, and said flag F gives F=FALSE, adding (X1, Y1) being contentsof said first buffer to said packet mode list, in the case where N≧2 isgiven, and said flag F gives F=TRUE and X1=X2 is given, replacing Y1with (Y+1) and thereafter adding (X1, Y1) being contents of said firstbuffer to said packet mode list; in the case where N≧2 is given, andsaid flag F gives F=TRUE and X1≠X2 is given, adding (X1, Y1) beingcontents of said first buffer to said packet mode list, and thereaftermoreover adding (X2, Y2) being contents of said second buffer to saidpacket mode list; in the case where N≧2 is given, adding (0, N−1) tosaid packet mode list and thereafter substituting 1 for X1, 1 for Y1, 0for X2, 0 for Y2 and FALSE for F respectively; lastly for each item (K,L) of said packet mode list, in case of K≧1, constructing K units ofsaid source packets as one unit of transmission packet data andarranging in series L units of said transmission packet data including Kunits of said source packets; and in case of K=0, with dummy data beingsaid transmission packet, arranging in series L units of said dummydata.
 43. A program to cause a computer to execute all or a part of thesteps, in the packet mode determining method according to claim 11 of:upon receipt of a source packet of T units for one pair (T≧1)constructed of a pair of data of the source packet data and a sourcepacket header including a time stamp, of the packet mode determiningmethod according to claim 11, all or a part of: in the case where Junits (J≧1) of said source packets are in safekeeping in a shuntingbuffer, adding a pair of (0, N0−1) to a packet mode list only when thekept difference number N0 is N0>1, and thereafter for a first bufferexpressed by a pair of two units of numeric values being (X1, Y1),substituting J for X1 and 1 for Y1; among M units of said sourcepackets, storing into said shunting buffer all said source packets thathave the same value as that in a predetermined portion of said timestamp of said source packet located in the last and that are broughtinto series with said source packet located in the last; submitting thenumber of units of said source packets stored in said shunting bufferfor J; and after substituting, for said kept difference number N0,difference between said time stamp of said source packet of the lastamong said source packets that are not stored in said shunting bufferand said time stamp of said source packet that is stored in saidshunting buffer, substituting FALSE for a flag F expressed by TRUE orFALSE and checking M units of said source packets sequentially from thehead; calculating difference N between a value of said time stampincluded in said source packet checked immediately prior thereto and avalue of said time stamp included in said source packet checked thistime; in the case where N=0 is given, and the flag F expressed by TRUEor FALSE gives F=TRUE, and a first buffer expressed by a pair of twounits of numeric values being (X1, Y1) fulfills X1=1 and Y1>1, after Y1is replaced with (Y1−1), adding (X1, Y1) being contents of said firstbuffer to a packet mode list, and moreover substituting X1=2, Y1=1 forsaid first buffer; in the case where N=0 is given, and said flag F isF=TRUE, and the first buffer expressed by a pair of two units of numericvalues of (X1, Y1) is X1≠1 and/or Y1≦1, replacing X1 with (X1+1); in thecase where N=0 is given, and said flag F is F=TRUE, replacing X1 of thefirst buffer expressed by a pair of two units of numeric values of (X1,Y1) with (X1+1); in the case where N=1, and said flag F is F=FALSE andX2≦1, substituting 1 for X1 and replacing Y1 with (Y1+1); in the casewhere N=1, and said flag F is F=FALSE and X2>1, making said flag Fconstitute F=TRUE, and at the same time, substituting 1 for X2 andreplacing Y2 with 1; in the case where N=1, and said flag F is F=TRUEand X2=0, replacing Y1 with (Y1+1), and at the same time, substituting 1for X2; in the case where N=1, and said flag F is F=TRUE and X2>0 andX1=X2, replacing Y1 with (Y1+1), and at the same time, substituting 1for X2 and 1 for Y2 respectively; in the case where N=1, and said flag Fgives F=TRUE, X2>0, X1≠X2, and X2>1, after adding (X1, Y1) beingcontents of said first buffer to said packet mode list, substituting X2for X1 and Y2 for Y1 respectively and thereafter substituting 1 for X2and 1 for Y2; in the case where N=1 is given, and said flag F givesF=TRUE, X2>0, X1≠X2, and X2≦1, after adding (X1, Y1) being contents ofsaid first buffer to said packet mode list, substituting 0 for X2 and 0for Y2 and thereafter substituting 1 for X1, 2 for Y1 and FALSE for F;in the case where N≧2 is given, and said flag F gives F=FALSE, adding(X1, Y1) being contents of said first buffer to said packet mode list;in the case where N≧2 is given, and said flag F gives F=TRUE and X1=X2is given, replacing Y1 with (Y+1) and thereafter adding (X1, Y1) beingcontents of said first buffer to said packet mode list; in the casewhere N≧2 is given, and said flag F gives F=TRUE and X1≠X2 is given,adding (X1, Y1) being contents of said first buffer to said packet modelist, and thereafter moreover adding (X2, Y2) being contents of saidsecond buffer to said packet mode list; in the case where N≧2 is given,arranging to add (0, N−1) to said packet mode list and thereaftersubstituting 1 for X1, 1 for Y1, 0 for X2, 0 for Y2 and FALSE for Frespectively; and after checking on all (T-J) units of said sourcepackets coming to an end; in the case where said flag F is F=FALSE, astep to add (X1, Y1) being contents of said first buffer to said packetmode list; in the case where said flag F gives F=TRUE and X1=X2, afterY1 is replaced with (Y1+1), adding (X1, Y1) being contents of said firstbuffer to said packet mode list; in the case where said flag F givesF=TRUE and X1≠X2, adding (X1, Y1) being contents of said first buffer tosaid packet mode list, and moreover adding (X2, Y2) being contents ofsaid second buffer to said packet mode list; lastly for each item (K, L)of said packet mode list, in case of K≧1, constructing K units of saidsource packets as one unit of transmission packet data and arranging inseries L units of said transmission packet data including K units ofsaid source packets; and in case of K=0, with dummy data being saidtransmission packet, arranging in series L units of said dummy data. 44.A program to cause a computer to execute all or a part of the steps, inthe packet mode determining method according to claim 13, of: uponreceipt of a source packet constructed of a pair of data of the sourcepacket data and a source packet header including a time stamp,calculating difference N between a value of said time stamp included insaid source packet received immediately prior thereto and a value of thetime stamp included in said source packet received this time; in thecase where said N gives N>(A+1), outputting (N−A−1) units of dummypackets, and thereafter splitting said source packet received this timeinto M units and outputting them, and at the same time substituting(M−1) for A; in the case where said N does not give N>(A+1), splittingsaid source packet received this time into M units and outputting them,and at the same time substituting (M−N) for A.
 45. A medium capable ofbeing processed by a computer that bears a program to cause a computerto execute all or a part of the steps, in the packet mode determiningmethod according to claim 9, of: upon receipt of a source packetconstructed of a pair of data of the source packet data and a sourcepacket header including a time stamp, substituting FALSE for a flag Fexpressed by TRUE or FALSE, and at the same time, calculating differenceN between a value of said time stamp included in said source packetreceived immediately prior thereto and a value of the time stampincluded in said source packet received this time; in the case where N=0is given, and the flag F expressed by TRUE or FALSE, gives F=TRUE, and afirst buffer expressed by a pair of two units of numeric values being(X1, Y1) fulfills X1=1 and Y1>1, after Y1 is replaced with (Y1−1),adding (X1, Y1) being contents of said first buffer to a packet modelist, and moreover substituting X1=2, Y1=1 for said first buffer; in thecase where N=0 is given, and said flag F is F=TRUE, and the first bufferexpressed by a pair of two units of numeric values of (X1, Y1) is X1≠1and/or Y1<1, replacing X1 with (X1+1); in the case where N=0 is given,and said flag F is F=TRUE, replacing X1 of the first buffer expressed bya pair of two units of numeric values (X1, Y1) with (X1+1); in the casewhere N=1, and said flag F is F=FALSE and X2≦1, substituting 1 for X1and replacing Y1 with (Y1+1); in the case where N=1, and said flag F isF=FALSE and X2>1, making said flag F constitute F=TRUE and, at the sametime, substituting 1 for X2 and 1 for Y2; in the case where N=1, andsaid flag F is F=TRUE and X2=0, replacing Y1 with (Y1+1) and, at thesame time, substituting 1 for X2; in the case where N=1, and said flag Fis F=TRUE and X2>0 and X1=X2, replacing Y1 with (Y1+1) and, at the sametime, substituting 1 for X2 and 1 for Y2 respectively; in the case whereN=1, and said flag F gives F=TRUE, X2>0, X1≠X2, and X2>1, after adding(X1, Y1) being contents of said first buffer to said packet mode list,substituting X2 for X1 and Y2 for Y1 respectively and thereaftersubstituting 1 for X2 and 1 for Y2; in the case where N=1 is given, andsaid flag F gives F=TRUE, X2>0, X1≠X2, and X2≦1, after adding (X1, Y1)being contents of said first buffer to said packet mode list,substituting 0 for X2 and 0 for Y2 and thereafter substituting 1 for X1,2 for Y1 and FALSE for F; in the case where N≧2 is given, and said flagF gives F=FALSE, adding (X1, Y1) being contents of said first buffer tosaid packet mode list; in the case where N≧2 is given, and said flag Fgives F=TRUE and X1=X2 is given, replacing Y1 with (Y+1) and thereafteradding (X1, Y1) being contents of said first buffer to said packet modelist; in the case where N≧2 is given, and said flag F gives F=TRUE andX1≠X2 is given, adding (X1, Y1) being contents of said first buffer tosaid packet mode list, and thereafter moreover adding (X2, Y2) beingcontents of said second buffer to said packet mode list; in the casewhere N≧2 is given, adding (0, N−1) to said packet mode list andthereafter substituting 1 for X1, 1 for Y1, 0 for X2, 0 for Y2 and FALSEfor F respectively; lastly for each item (K, L) of said packet modelist, in case of K≧1, constructing K units of said source packets as oneunit of transmission packet data and arranging in series L units of saidtransmission packet data including K units of said source packets; andin case of K=0, with dummy data being said transmission packet,arranging in series L units of said dummy data.
 46. A medium capable ofbeing processed by a computer that bears a program to cause a computerto execute all or a part of the steps, in the packet mode determiningmethod according to claim 11 of: upon receipt of a source packet of Tunits for one pair (T≧1) constructed of a pair of data of the sourcepacket data and a source packet header including a time stamp, in thecase where J units (J≧1) of said source packets are in safekeeping in ashunting buffer, adding a pair of (0, N0−1) to a packet mode list onlywhen the kept difference number N0 is N0>1, and thereafter for a firstbuffer expressed by a pair of two units of numeric values being (X1,Y1), substituting J for X1 and 1 for Y1; among M units of said sourcepackets, storing into said shunting buffer all said source packets thathave the same value as that in a predetermined portion of said timestamp of said source packet located in the last and that are broughtinto series with said source packet located in the last; substitutingthe number of units of said source packets stored in said shuntingbuffer for J; after substituting, for said kept difference number N0,difference between said time stamp of said source packet of the lastamong said source packets that are not stored in said shunting bufferand said time stamp of said source packet that is stored in saidshunting buffer; substituting FALSE for a flag F expressed by TRUE orFALSE and checking M units of said source packets sequentially from thehead; calculating difference N between a value of said time stampincluded in said source packet checked immediately prior thereto and avalue of said time stamp included in said source packet checked thistime; in the case where N=0 is given, and the flag F expressed by TRUEor FALSE gives F=TRUE, and a first buffer expressed by a pair of twounits of numeric values being (X1, Y1) fulfills X1=1 and Y1>1, after Y1is replaced with (Y1−1) adding (X1, Y1) being contents of said firstbuffer to a packet mode list, and moreover substitute X1=2, Y1=1 forsaid first buffer; in the case where N=0 is given, and said flag F isF=TRUE, and the first buffer expressed by a pair of two units of numericvalues of (X1, Y1) is X1≠1 and/or Y1≦1, replacing X1 with (X1+1); in thecase where N=0 is given, and said flag F is F=TRUE, replacing X1 of thefirst buffer expressed by a pair of two units of numeric values of (X1,Y1) with (X1+1); in the case where N=1, and said flag F is F=FALSE andX2≦1, substituting 1 for X1 and replacing Y1 with (Y1+1); in the casewhere N=1, and said flag F is F=FALSE and X2>1, a step to make said flagF constitute F=TRUE and, at the same time, substituting 1 for X2 and 1for Y2; in the case where N=1, and said flag F is F=TRUE and X2=0,replacing Y1 with (Y1+1) and, at the same time, substituting 1 for X2;in the case where N=1, and said flag F is F=TRUE and X2>0 and X1=X2,replacing Y1 with (Y1+1) and, at the same time, substituting 1 for X2and 1 for Y2 respectively; in the case where N=1, and said flag F givesF=TRUE, X2>0, X1≠X2, and X2>1, after adding (X1, Y1) being contents ofsaid first buffer to said packet mode list, substituting X2 for X1 andY2 for Y1 respectively and thereafter substituting 1 for X2 and 1 forY2; in the case where N=1 is given, and said flag F gives F=TRUE, X2>0,X1≠X2, and X2≦1, after adding (X1, Y1) being contents of said firstbuffer to said packet mode list, substituting 0 for X2 and 0 for Y2 andthereafter substituting 1 for X1, 2 for Y1 and FALSE for F; in the casewhere N≧2 is given, and said flag F gives F=FALSE, (X1, Y1) beingcontents of said first buffer to said packet mode list, adding (X1, Y1)being contents of said first buffer to said packet mode list; in thecase where N≧2 is given, and said flag F gives F=TRUE and X1=X2 isgiven, replacing Y1 with (Y+1) and thereafter adding (X1, Y1) beingcontents of said first buffer to said packet mode list; in the casewhere N≧2 is given, and said flag F gives F=TRUE and X1≠X2 is given,adding (X1, Y1) being contents of said first buffer to said packet modelist, and thereafter moreover adding (X2, Y2) being contents of saidsecond buffer to said packet mode list; in the case where N≧2 is given,arranging to add (0, N−1) to said packet mode list and thereaftersubstituting 1 for X1, 1 for Y1, 0 for X2, 0 for Y2 and FALSE for Frespectively; and after checking on all (T-J) units of said sourcepackets coming to an end, in the case where said flag F is F=FALSE,adding (X1, Y1) being contents of said first buffer to said packet modelist; in the case where said flag F gives F=TRUE and X1=X2, after Y1 isreplaced with (Y1+1), adding (X1, Y1) being contents of said firstbuffer to said packet mode list; in the case where said flag F givesF=TRUE and X1≠X2, adding (X1, Y1) being contents of said first buffer tosaid packet mode list, and moreover adding (X2, Y2) being contents ofsaid second buffer to said packet mode list; lastly for each item (K, L)of said packet mode list, in case of K≧1, constructing K units of saidsource packets as one unit of transmission packet data and arranging inseries L units of said transmission packet data including K units ofsaid source packets; and in case of K=0, with dummy data being saidtransmission packet, arranging in series L units of said dummy data. 47.A medium capable of being processed by a computer that bears a programto cause a computer to execute all or a part of the steps, in the packetmode determining method according to claim 13, of: upon in receipt of asource packet constructed of a pair of data of the source packet dataand a source packet header including a time stamp, calculatingdifference N between a value of said time stamp included in said sourcepacket received immediately prior thereto and a value of the time stampincluded in said source packet received this time; in the case wheresaid N gives N>(A+1), outputting (N−A−1) units of dummy packets, andthereafter splitting said source packet received this time into M unitsand outputting them, and at the same time substituting (M−1) for A; inthe case where said N does not give N>(A+1), splitting said sourcepacket received this time into M units and outputting them, and at thesame time substituting (M−N) for A.
 48. A transmitting method fortransmitting a source packet constructed of a pair of data of a sourcepacket data and a source packet header including a time stamp,comprising: a step of investigating values of a predetermined portion ofsaid time stamp included in said source packet when said source packetis inputted, unifying said source packets that have a same value forsaid predetermined portion and are inputted in series to output as oneunit of transmission packet data; and a step of producing a transmissionpacket by adding predetermined additional information to said outputtedtransmission packet data and outputting said produced transmissionpacket outward.
 49. A transmitting method for transmitting a sourcepacket constructed of a pair of data of the source packet data and asource packet header including a time stamp, comprising: a step of splitnumber designating means of designating a split number M (M≧1) to splitsaid source packet; a step of investigating values of a predeterminedportion of said time stamp included in said source packet when saidsource packet is inputted, outputting said M units split from saidsource packet as transmission packet data when difference between valuesof predetermined portions of said time stamp included in said two sourcepackets in series is N(N≧0) being N≦L(L≧1), and outputting (N−L) unitsof dummy transmission packet data when difference between values of saidpredetermined portions of said time stamp is N being N>L; and a step ofoutputting as transmission packet outward those being said outputtedtransmission packet data and/or said dummy transmission packet data towhich a predetermined additional information is added.
 50. A sourcepacket generating method, comprising: a step of generationg a datapacket transmitted in a first clock, and determining transmission timingof said data packet expressed in said first clock; and a step ofconverting said transmission timing to time information on a time axisexpressed in a second clock, adding to said data packet the time stampwith a value determined based on all or a part of said time informationand outputting a data packet to which the time stamp is added as asource packet; wherein outputted said source packet is converted into apacket for transmission based on the value of that added time stamp isoutputted from an interface.